./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr001_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr001_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d512510f2eabc5c82b8eb84e1b56885b21642e76 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:59:21,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:59:21,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:59:21,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:59:21,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:59:21,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:59:21,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:59:21,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:59:21,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:59:21,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:59:21,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:59:21,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:59:21,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:59:21,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:59:21,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:59:21,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:59:21,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:59:21,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:59:21,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:59:21,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:59:21,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:59:21,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:59:21,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:59:21,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:59:21,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:59:21,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:59:21,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:59:21,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:59:21,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:59:21,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:59:21,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:59:21,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:59:21,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:59:21,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:59:21,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:59:21,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:59:21,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:59:21,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:59:21,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:59:21,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:59:21,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:59:21,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:59:21,212 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:59:21,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:59:21,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:59:21,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:59:21,213 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:59:21,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:59:21,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:59:21,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:59:21,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:59:21,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:59:21,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:59:21,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:59:21,216 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:59:21,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d512510f2eabc5c82b8eb84e1b56885b21642e76 [2019-12-07 12:59:21,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:59:21,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:59:21,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:59:21,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:59:21,324 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:59:21,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr001_rmo.oepc.i [2019-12-07 12:59:21,360 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/data/7f06e050f/342e0a5ce08e409987d36f74bf5878e8/FLAGbb61cd9fa [2019-12-07 12:59:21,843 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:59:21,844 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/sv-benchmarks/c/pthread-wmm/podwr001_rmo.oepc.i [2019-12-07 12:59:21,855 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/data/7f06e050f/342e0a5ce08e409987d36f74bf5878e8/FLAGbb61cd9fa [2019-12-07 12:59:21,863 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/data/7f06e050f/342e0a5ce08e409987d36f74bf5878e8 [2019-12-07 12:59:21,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:59:21,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:59:21,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:21,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:59:21,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:59:21,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:21" (1/1) ... [2019-12-07 12:59:21,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:21, skipping insertion in model container [2019-12-07 12:59:21,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:21" (1/1) ... [2019-12-07 12:59:21,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:59:21,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:59:22,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:22,151 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:59:22,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:22,239 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:59:22,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22 WrapperNode [2019-12-07 12:59:22,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:22,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:22,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:59:22,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:59:22,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:22,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:59:22,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:59:22,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:59:22,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... [2019-12-07 12:59:22,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:59:22,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:59:22,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:59:22,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:59:22,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:59:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:59:22,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:59:22,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:59:22,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:59:22,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:59:22,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:59:22,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:59:22,357 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:59:22,717 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:59:22,717 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:59:22,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:22 BoogieIcfgContainer [2019-12-07 12:59:22,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:59:22,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:59:22,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:59:22,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:59:22,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:59:21" (1/3) ... [2019-12-07 12:59:22,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5894885c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:22, skipping insertion in model container [2019-12-07 12:59:22,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:22" (2/3) ... [2019-12-07 12:59:22,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5894885c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:22, skipping insertion in model container [2019-12-07 12:59:22,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:22" (3/3) ... [2019-12-07 12:59:22,723 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_rmo.oepc.i [2019-12-07 12:59:22,729 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:59:22,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:59:22,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:59:22,735 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:59:22,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:59:22,798 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:59:22,812 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:59:22,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:59:22,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:59:22,812 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:59:22,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:59:22,812 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:59:22,812 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:59:22,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:59:22,823 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-07 12:59:22,824 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 12:59:22,891 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 12:59:22,891 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:59:22,901 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 12:59:22,916 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 12:59:22,955 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 12:59:22,955 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:59:22,961 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 12:59:22,976 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 12:59:22,977 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:59:25,903 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 12:59:26,207 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-07 12:59:26,207 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 12:59:26,209 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-07 12:59:45,379 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-07 12:59:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-07 12:59:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:59:45,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:45,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:59:45,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-07 12:59:45,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:45,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052260968] [2019-12-07 12:59:45,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:45,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052260968] [2019-12-07 12:59:45,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:45,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:59:45,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932314234] [2019-12-07 12:59:45,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:59:45,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:59:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:45,535 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-07 12:59:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:46,292 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-07 12:59:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:59:46,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:59:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:46,771 INFO L225 Difference]: With dead ends: 125570 [2019-12-07 12:59:46,771 INFO L226 Difference]: Without dead ends: 111010 [2019-12-07 12:59:46,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:59:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-07 12:59:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-07 12:59:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-07 12:59:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-07 12:59:55,101 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-07 12:59:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:55,101 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-07 12:59:55,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:59:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-07 12:59:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:59:55,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:55,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:55,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-07 12:59:55,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:59:55,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142594796] [2019-12-07 12:59:55,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:59:55,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142594796] [2019-12-07 12:59:55,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:55,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:59:55,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988264229] [2019-12-07 12:59:55,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:55,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:59:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:55,167 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-07 12:59:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:56,072 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-07 12:59:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:59:56,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:59:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:56,512 INFO L225 Difference]: With dead ends: 172646 [2019-12-07 12:59:56,512 INFO L226 Difference]: Without dead ends: 172548 [2019-12-07 12:59:56,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-07 13:00:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-07 13:00:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-07 13:00:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-07 13:00:05,045 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-07 13:00:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:05,046 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-07 13:00:05,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-07 13:00:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:00:05,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:05,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:05,051 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:05,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-07 13:00:05,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:00:05,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925654706] [2019-12-07 13:00:05,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:05,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925654706] [2019-12-07 13:00:05,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:05,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:05,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794989857] [2019-12-07 13:00:05,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:05,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:00:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:05,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:05,102 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 4 states. [2019-12-07 13:00:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:07,803 INFO L93 Difference]: Finished difference Result 228902 states and 931210 transitions. [2019-12-07 13:00:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:00:07,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:00:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:08,419 INFO L225 Difference]: With dead ends: 228902 [2019-12-07 13:00:08,419 INFO L226 Difference]: Without dead ends: 228790 [2019-12-07 13:00:08,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228790 states. [2019-12-07 13:00:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228790 to 192327. [2019-12-07 13:00:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192327 states. [2019-12-07 13:00:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192327 states to 192327 states and 796272 transitions. [2019-12-07 13:00:18,266 INFO L78 Accepts]: Start accepts. Automaton has 192327 states and 796272 transitions. Word has length 13 [2019-12-07 13:00:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:18,267 INFO L462 AbstractCegarLoop]: Abstraction has 192327 states and 796272 transitions. [2019-12-07 13:00:18,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 192327 states and 796272 transitions. [2019-12-07 13:00:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:00:18,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:18,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:18,274 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-07 13:00:18,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:00:18,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777437681] [2019-12-07 13:00:18,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:18,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777437681] [2019-12-07 13:00:18,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:18,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:00:18,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025019175] [2019-12-07 13:00:18,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:18,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:00:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:18,305 INFO L87 Difference]: Start difference. First operand 192327 states and 796272 transitions. Second operand 3 states. [2019-12-07 13:00:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:20,032 INFO L93 Difference]: Finished difference Result 280788 states and 1158875 transitions. [2019-12-07 13:00:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:20,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:00:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:20,738 INFO L225 Difference]: With dead ends: 280788 [2019-12-07 13:00:20,738 INFO L226 Difference]: Without dead ends: 280788 [2019-12-07 13:00:20,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280788 states. [2019-12-07 13:00:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280788 to 222888. [2019-12-07 13:00:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222888 states. [2019-12-07 13:00:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222888 states to 222888 states and 926633 transitions. [2019-12-07 13:00:34,459 INFO L78 Accepts]: Start accepts. Automaton has 222888 states and 926633 transitions. Word has length 16 [2019-12-07 13:00:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:34,459 INFO L462 AbstractCegarLoop]: Abstraction has 222888 states and 926633 transitions. [2019-12-07 13:00:34,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 222888 states and 926633 transitions. [2019-12-07 13:00:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:00:34,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:34,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:34,466 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-07 13:00:34,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:00:34,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828522088] [2019-12-07 13:00:34,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:34,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828522088] [2019-12-07 13:00:34,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:34,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:00:34,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463995520] [2019-12-07 13:00:34,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:00:34,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:00:34,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:00:34,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:34,510 INFO L87 Difference]: Start difference. First operand 222888 states and 926633 transitions. Second operand 5 states. [2019-12-07 13:00:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:36,558 INFO L93 Difference]: Finished difference Result 298473 states and 1226263 transitions. [2019-12-07 13:00:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:00:36,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 13:00:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:37,312 INFO L225 Difference]: With dead ends: 298473 [2019-12-07 13:00:37,312 INFO L226 Difference]: Without dead ends: 298473 [2019-12-07 13:00:37,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:00:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298473 states. [2019-12-07 13:00:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298473 to 237826. [2019-12-07 13:00:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237826 states. [2019-12-07 13:00:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237826 states to 237826 states and 988542 transitions. [2019-12-07 13:00:52,094 INFO L78 Accepts]: Start accepts. Automaton has 237826 states and 988542 transitions. Word has length 16 [2019-12-07 13:00:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:52,094 INFO L462 AbstractCegarLoop]: Abstraction has 237826 states and 988542 transitions. [2019-12-07 13:00:52,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:00:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 237826 states and 988542 transitions. [2019-12-07 13:00:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:00:52,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:52,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:52,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash -504931817, now seen corresponding path program 1 times [2019-12-07 13:00:52,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:00:52,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560640485] [2019-12-07 13:00:52,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:52,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560640485] [2019-12-07 13:00:52,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:52,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:52,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294144302] [2019-12-07 13:00:52,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:52,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:00:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:52,147 INFO L87 Difference]: Start difference. First operand 237826 states and 988542 transitions. Second operand 3 states. [2019-12-07 13:00:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:53,193 INFO L93 Difference]: Finished difference Result 237826 states and 978678 transitions. [2019-12-07 13:00:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:53,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:00:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:53,807 INFO L225 Difference]: With dead ends: 237826 [2019-12-07 13:00:53,808 INFO L226 Difference]: Without dead ends: 237826 [2019-12-07 13:00:53,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237826 states. [2019-12-07 13:01:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237826 to 234480. [2019-12-07 13:01:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234480 states. [2019-12-07 13:01:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234480 states to 234480 states and 966258 transitions. [2019-12-07 13:01:07,526 INFO L78 Accepts]: Start accepts. Automaton has 234480 states and 966258 transitions. Word has length 18 [2019-12-07 13:01:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:07,526 INFO L462 AbstractCegarLoop]: Abstraction has 234480 states and 966258 transitions. [2019-12-07 13:01:07,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 234480 states and 966258 transitions. [2019-12-07 13:01:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:01:07,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:07,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:07,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 138207619, now seen corresponding path program 1 times [2019-12-07 13:01:07,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:07,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282149148] [2019-12-07 13:01:07,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:07,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282149148] [2019-12-07 13:01:07,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:07,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:07,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942877082] [2019-12-07 13:01:07,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:07,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:07,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:07,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:07,566 INFO L87 Difference]: Start difference. First operand 234480 states and 966258 transitions. Second operand 3 states. [2019-12-07 13:01:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:07,699 INFO L93 Difference]: Finished difference Result 42613 states and 138837 transitions. [2019-12-07 13:01:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:07,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:01:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:07,757 INFO L225 Difference]: With dead ends: 42613 [2019-12-07 13:01:07,757 INFO L226 Difference]: Without dead ends: 42613 [2019-12-07 13:01:07,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42613 states. [2019-12-07 13:01:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42613 to 42613. [2019-12-07 13:01:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42613 states. [2019-12-07 13:01:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42613 states to 42613 states and 138837 transitions. [2019-12-07 13:01:08,467 INFO L78 Accepts]: Start accepts. Automaton has 42613 states and 138837 transitions. Word has length 18 [2019-12-07 13:01:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:08,467 INFO L462 AbstractCegarLoop]: Abstraction has 42613 states and 138837 transitions. [2019-12-07 13:01:08,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 42613 states and 138837 transitions. [2019-12-07 13:01:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:01:08,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:08,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:08,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-07 13:01:08,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:08,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192781602] [2019-12-07 13:01:08,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:08,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192781602] [2019-12-07 13:01:08,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:08,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:01:08,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824780034] [2019-12-07 13:01:08,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:01:08,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:08,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:01:08,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:01:08,520 INFO L87 Difference]: Start difference. First operand 42613 states and 138837 transitions. Second operand 6 states. [2019-12-07 13:01:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:09,060 INFO L93 Difference]: Finished difference Result 65056 states and 205947 transitions. [2019-12-07 13:01:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:01:09,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:01:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:09,155 INFO L225 Difference]: With dead ends: 65056 [2019-12-07 13:01:09,156 INFO L226 Difference]: Without dead ends: 65042 [2019-12-07 13:01:09,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:01:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2019-12-07 13:01:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 42278. [2019-12-07 13:01:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-12-07 13:01:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 137592 transitions. [2019-12-07 13:01:10,361 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 137592 transitions. Word has length 22 [2019-12-07 13:01:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:10,361 INFO L462 AbstractCegarLoop]: Abstraction has 42278 states and 137592 transitions. [2019-12-07 13:01:10,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:01:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 137592 transitions. [2019-12-07 13:01:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:01:10,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:10,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:10,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-07 13:01:10,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:10,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808839695] [2019-12-07 13:01:10,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:10,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808839695] [2019-12-07 13:01:10,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:10,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:10,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963435194] [2019-12-07 13:01:10,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:10,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:10,417 INFO L87 Difference]: Start difference. First operand 42278 states and 137592 transitions. Second operand 5 states. [2019-12-07 13:01:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:10,832 INFO L93 Difference]: Finished difference Result 59726 states and 189950 transitions. [2019-12-07 13:01:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:01:10,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:01:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:10,924 INFO L225 Difference]: With dead ends: 59726 [2019-12-07 13:01:10,924 INFO L226 Difference]: Without dead ends: 59700 [2019-12-07 13:01:10,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:01:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59700 states. [2019-12-07 13:01:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59700 to 50129. [2019-12-07 13:01:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50129 states. [2019-12-07 13:01:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50129 states to 50129 states and 162181 transitions. [2019-12-07 13:01:11,873 INFO L78 Accepts]: Start accepts. Automaton has 50129 states and 162181 transitions. Word has length 25 [2019-12-07 13:01:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:11,874 INFO L462 AbstractCegarLoop]: Abstraction has 50129 states and 162181 transitions. [2019-12-07 13:01:11,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 50129 states and 162181 transitions. [2019-12-07 13:01:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:01:11,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:11,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:11,890 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-07 13:01:11,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:11,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270274963] [2019-12-07 13:01:11,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:11,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270274963] [2019-12-07 13:01:11,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:11,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:01:11,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467744892] [2019-12-07 13:01:11,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:01:11,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:11,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:01:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:01:11,937 INFO L87 Difference]: Start difference. First operand 50129 states and 162181 transitions. Second operand 6 states. [2019-12-07 13:01:12,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:12,583 INFO L93 Difference]: Finished difference Result 71592 states and 224983 transitions. [2019-12-07 13:01:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:01:12,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 13:01:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:12,680 INFO L225 Difference]: With dead ends: 71592 [2019-12-07 13:01:12,681 INFO L226 Difference]: Without dead ends: 71508 [2019-12-07 13:01:12,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:01:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71508 states. [2019-12-07 13:01:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71508 to 53724. [2019-12-07 13:01:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53724 states. [2019-12-07 13:01:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53724 states to 53724 states and 172706 transitions. [2019-12-07 13:01:13,732 INFO L78 Accepts]: Start accepts. Automaton has 53724 states and 172706 transitions. Word has length 27 [2019-12-07 13:01:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:13,732 INFO L462 AbstractCegarLoop]: Abstraction has 53724 states and 172706 transitions. [2019-12-07 13:01:13,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:01:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 53724 states and 172706 transitions. [2019-12-07 13:01:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:01:13,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:13,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:13,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -969078927, now seen corresponding path program 1 times [2019-12-07 13:01:13,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:13,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843457227] [2019-12-07 13:01:13,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:13,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843457227] [2019-12-07 13:01:13,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:13,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:13,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007021576] [2019-12-07 13:01:13,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:13,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:13,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:13,788 INFO L87 Difference]: Start difference. First operand 53724 states and 172706 transitions. Second operand 4 states. [2019-12-07 13:01:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:13,846 INFO L93 Difference]: Finished difference Result 20754 states and 64022 transitions. [2019-12-07 13:01:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:01:13,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 13:01:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:13,870 INFO L225 Difference]: With dead ends: 20754 [2019-12-07 13:01:13,870 INFO L226 Difference]: Without dead ends: 20754 [2019-12-07 13:01:13,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20754 states. [2019-12-07 13:01:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20754 to 19543. [2019-12-07 13:01:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19543 states. [2019-12-07 13:01:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 60338 transitions. [2019-12-07 13:01:14,169 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 60338 transitions. Word has length 29 [2019-12-07 13:01:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:14,169 INFO L462 AbstractCegarLoop]: Abstraction has 19543 states and 60338 transitions. [2019-12-07 13:01:14,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 60338 transitions. [2019-12-07 13:01:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:01:14,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:14,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:14,187 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-07 13:01:14,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:14,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045934402] [2019-12-07 13:01:14,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:14,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045934402] [2019-12-07 13:01:14,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:14,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:01:14,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306302497] [2019-12-07 13:01:14,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:01:14,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:01:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:01:14,238 INFO L87 Difference]: Start difference. First operand 19543 states and 60338 transitions. Second operand 7 states. [2019-12-07 13:01:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:14,948 INFO L93 Difference]: Finished difference Result 27225 states and 81337 transitions. [2019-12-07 13:01:14,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:01:14,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 13:01:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:14,981 INFO L225 Difference]: With dead ends: 27225 [2019-12-07 13:01:14,981 INFO L226 Difference]: Without dead ends: 27225 [2019-12-07 13:01:14,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:01:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27225 states. [2019-12-07 13:01:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27225 to 19532. [2019-12-07 13:01:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19532 states. [2019-12-07 13:01:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19532 states to 19532 states and 60108 transitions. [2019-12-07 13:01:15,348 INFO L78 Accepts]: Start accepts. Automaton has 19532 states and 60108 transitions. Word has length 33 [2019-12-07 13:01:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:15,348 INFO L462 AbstractCegarLoop]: Abstraction has 19532 states and 60108 transitions. [2019-12-07 13:01:15,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:01:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19532 states and 60108 transitions. [2019-12-07 13:01:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:01:15,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:15,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:15,364 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1293540528, now seen corresponding path program 1 times [2019-12-07 13:01:15,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:15,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677683667] [2019-12-07 13:01:15,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:15,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677683667] [2019-12-07 13:01:15,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:15,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:15,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449540101] [2019-12-07 13:01:15,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:15,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:15,414 INFO L87 Difference]: Start difference. First operand 19532 states and 60108 transitions. Second operand 3 states. [2019-12-07 13:01:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:15,469 INFO L93 Difference]: Finished difference Result 18664 states and 56622 transitions. [2019-12-07 13:01:15,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:15,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 13:01:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:15,490 INFO L225 Difference]: With dead ends: 18664 [2019-12-07 13:01:15,490 INFO L226 Difference]: Without dead ends: 18664 [2019-12-07 13:01:15,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2019-12-07 13:01:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 18390. [2019-12-07 13:01:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18390 states. [2019-12-07 13:01:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18390 states to 18390 states and 55854 transitions. [2019-12-07 13:01:15,751 INFO L78 Accepts]: Start accepts. Automaton has 18390 states and 55854 transitions. Word has length 40 [2019-12-07 13:01:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:15,751 INFO L462 AbstractCegarLoop]: Abstraction has 18390 states and 55854 transitions. [2019-12-07 13:01:15,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18390 states and 55854 transitions. [2019-12-07 13:01:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:01:15,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:15,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:15,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash -448595313, now seen corresponding path program 1 times [2019-12-07 13:01:15,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:15,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766151953] [2019-12-07 13:01:15,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:15,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766151953] [2019-12-07 13:01:15,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:15,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:01:15,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517175387] [2019-12-07 13:01:15,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:15,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:15,811 INFO L87 Difference]: Start difference. First operand 18390 states and 55854 transitions. Second operand 5 states. [2019-12-07 13:01:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:15,869 INFO L93 Difference]: Finished difference Result 16867 states and 52454 transitions. [2019-12-07 13:01:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:15,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 13:01:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:15,890 INFO L225 Difference]: With dead ends: 16867 [2019-12-07 13:01:15,890 INFO L226 Difference]: Without dead ends: 16867 [2019-12-07 13:01:15,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16867 states. [2019-12-07 13:01:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16867 to 15238. [2019-12-07 13:01:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15238 states. [2019-12-07 13:01:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15238 states to 15238 states and 47616 transitions. [2019-12-07 13:01:16,136 INFO L78 Accepts]: Start accepts. Automaton has 15238 states and 47616 transitions. Word has length 41 [2019-12-07 13:01:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:16,137 INFO L462 AbstractCegarLoop]: Abstraction has 15238 states and 47616 transitions. [2019-12-07 13:01:16,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15238 states and 47616 transitions. [2019-12-07 13:01:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:01:16,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:16,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:16,152 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1623524162, now seen corresponding path program 1 times [2019-12-07 13:01:16,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:16,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128616352] [2019-12-07 13:01:16,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:16,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128616352] [2019-12-07 13:01:16,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:16,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:16,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542354669] [2019-12-07 13:01:16,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:16,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:16,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:16,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:16,194 INFO L87 Difference]: Start difference. First operand 15238 states and 47616 transitions. Second operand 3 states. [2019-12-07 13:01:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:16,268 INFO L93 Difference]: Finished difference Result 18380 states and 57153 transitions. [2019-12-07 13:01:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:16,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:01:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:16,287 INFO L225 Difference]: With dead ends: 18380 [2019-12-07 13:01:16,288 INFO L226 Difference]: Without dead ends: 18380 [2019-12-07 13:01:16,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-12-07 13:01:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 15494. [2019-12-07 13:01:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15494 states. [2019-12-07 13:01:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15494 states to 15494 states and 48492 transitions. [2019-12-07 13:01:16,537 INFO L78 Accepts]: Start accepts. Automaton has 15494 states and 48492 transitions. Word has length 66 [2019-12-07 13:01:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:16,537 INFO L462 AbstractCegarLoop]: Abstraction has 15494 states and 48492 transitions. [2019-12-07 13:01:16,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 15494 states and 48492 transitions. [2019-12-07 13:01:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:16,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:16,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:16,555 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 600429612, now seen corresponding path program 1 times [2019-12-07 13:01:16,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:16,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834859434] [2019-12-07 13:01:16,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:16,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834859434] [2019-12-07 13:01:16,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:16,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:16,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512576348] [2019-12-07 13:01:16,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:16,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:16,609 INFO L87 Difference]: Start difference. First operand 15494 states and 48492 transitions. Second operand 4 states. [2019-12-07 13:01:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:16,719 INFO L93 Difference]: Finished difference Result 18353 states and 57063 transitions. [2019-12-07 13:01:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:01:16,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 13:01:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:16,748 INFO L225 Difference]: With dead ends: 18353 [2019-12-07 13:01:16,748 INFO L226 Difference]: Without dead ends: 18353 [2019-12-07 13:01:16,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18353 states. [2019-12-07 13:01:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18353 to 15150. [2019-12-07 13:01:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15150 states. [2019-12-07 13:01:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15150 states to 15150 states and 47431 transitions. [2019-12-07 13:01:17,013 INFO L78 Accepts]: Start accepts. Automaton has 15150 states and 47431 transitions. Word has length 67 [2019-12-07 13:01:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:17,013 INFO L462 AbstractCegarLoop]: Abstraction has 15150 states and 47431 transitions. [2019-12-07 13:01:17,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15150 states and 47431 transitions. [2019-12-07 13:01:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:17,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:17,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:17,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-07 13:01:17,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:17,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79471969] [2019-12-07 13:01:17,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:17,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79471969] [2019-12-07 13:01:17,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:17,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:01:17,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694597545] [2019-12-07 13:01:17,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:01:17,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:01:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:01:17,334 INFO L87 Difference]: Start difference. First operand 15150 states and 47431 transitions. Second operand 15 states. [2019-12-07 13:01:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:19,365 INFO L93 Difference]: Finished difference Result 26608 states and 82068 transitions. [2019-12-07 13:01:19,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 13:01:19,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 13:01:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:19,386 INFO L225 Difference]: With dead ends: 26608 [2019-12-07 13:01:19,386 INFO L226 Difference]: Without dead ends: 19579 [2019-12-07 13:01:19,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:01:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19579 states. [2019-12-07 13:01:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19579 to 17238. [2019-12-07 13:01:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17238 states. [2019-12-07 13:01:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17238 states to 17238 states and 53847 transitions. [2019-12-07 13:01:19,662 INFO L78 Accepts]: Start accepts. Automaton has 17238 states and 53847 transitions. Word has length 67 [2019-12-07 13:01:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:19,662 INFO L462 AbstractCegarLoop]: Abstraction has 17238 states and 53847 transitions. [2019-12-07 13:01:19,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:01:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17238 states and 53847 transitions. [2019-12-07 13:01:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:19,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:19,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:19,678 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1244941018, now seen corresponding path program 2 times [2019-12-07 13:01:19,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:19,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97233942] [2019-12-07 13:01:19,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:19,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97233942] [2019-12-07 13:01:19,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:19,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:01:19,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262509715] [2019-12-07 13:01:19,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:01:19,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:19,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:01:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:01:19,782 INFO L87 Difference]: Start difference. First operand 17238 states and 53847 transitions. Second operand 10 states. [2019-12-07 13:01:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:20,971 INFO L93 Difference]: Finished difference Result 36869 states and 114951 transitions. [2019-12-07 13:01:20,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 13:01:20,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 13:01:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:21,002 INFO L225 Difference]: With dead ends: 36869 [2019-12-07 13:01:21,003 INFO L226 Difference]: Without dead ends: 25235 [2019-12-07 13:01:21,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:01:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25235 states. [2019-12-07 13:01:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25235 to 17850. [2019-12-07 13:01:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17850 states. [2019-12-07 13:01:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 55556 transitions. [2019-12-07 13:01:21,324 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 55556 transitions. Word has length 67 [2019-12-07 13:01:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:21,324 INFO L462 AbstractCegarLoop]: Abstraction has 17850 states and 55556 transitions. [2019-12-07 13:01:21,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:01:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 55556 transitions. [2019-12-07 13:01:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:21,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:21,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:21,340 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1908292690, now seen corresponding path program 3 times [2019-12-07 13:01:21,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:21,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468294042] [2019-12-07 13:01:21,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:21,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468294042] [2019-12-07 13:01:21,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:21,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:01:21,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2566616] [2019-12-07 13:01:21,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:01:21,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:01:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:01:21,458 INFO L87 Difference]: Start difference. First operand 17850 states and 55556 transitions. Second operand 10 states. [2019-12-07 13:01:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:23,162 INFO L93 Difference]: Finished difference Result 30552 states and 94501 transitions. [2019-12-07 13:01:23,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 13:01:23,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 13:01:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:23,193 INFO L225 Difference]: With dead ends: 30552 [2019-12-07 13:01:23,194 INFO L226 Difference]: Without dead ends: 25997 [2019-12-07 13:01:23,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:01:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25997 states. [2019-12-07 13:01:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25997 to 18290. [2019-12-07 13:01:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2019-12-07 13:01:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 56760 transitions. [2019-12-07 13:01:23,546 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 56760 transitions. Word has length 67 [2019-12-07 13:01:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:23,546 INFO L462 AbstractCegarLoop]: Abstraction has 18290 states and 56760 transitions. [2019-12-07 13:01:23,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:01:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 56760 transitions. [2019-12-07 13:01:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:23,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:23,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:23,561 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash 993635084, now seen corresponding path program 4 times [2019-12-07 13:01:23,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:23,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442501760] [2019-12-07 13:01:23,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:23,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442501760] [2019-12-07 13:01:23,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:23,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:01:23,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194042256] [2019-12-07 13:01:23,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:01:23,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:23,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:01:23,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:01:23,704 INFO L87 Difference]: Start difference. First operand 18290 states and 56760 transitions. Second operand 11 states. [2019-12-07 13:01:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:24,641 INFO L93 Difference]: Finished difference Result 28644 states and 88548 transitions. [2019-12-07 13:01:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 13:01:24,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 13:01:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:24,671 INFO L225 Difference]: With dead ends: 28644 [2019-12-07 13:01:24,671 INFO L226 Difference]: Without dead ends: 25165 [2019-12-07 13:01:24,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:01:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25165 states. [2019-12-07 13:01:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25165 to 17874. [2019-12-07 13:01:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17874 states. [2019-12-07 13:01:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17874 states to 17874 states and 55488 transitions. [2019-12-07 13:01:24,995 INFO L78 Accepts]: Start accepts. Automaton has 17874 states and 55488 transitions. Word has length 67 [2019-12-07 13:01:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:24,996 INFO L462 AbstractCegarLoop]: Abstraction has 17874 states and 55488 transitions. [2019-12-07 13:01:24,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:01:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 17874 states and 55488 transitions. [2019-12-07 13:01:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:25,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:25,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:25,011 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 5 times [2019-12-07 13:01:25,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:25,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164406094] [2019-12-07 13:01:25,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:25,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164406094] [2019-12-07 13:01:25,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:25,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 13:01:25,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758215294] [2019-12-07 13:01:25,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 13:01:25,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 13:01:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:01:25,275 INFO L87 Difference]: Start difference. First operand 17874 states and 55488 transitions. Second operand 18 states. [2019-12-07 13:01:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:27,680 INFO L93 Difference]: Finished difference Result 23296 states and 71289 transitions. [2019-12-07 13:01:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:01:27,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-07 13:01:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:27,717 INFO L225 Difference]: With dead ends: 23296 [2019-12-07 13:01:27,717 INFO L226 Difference]: Without dead ends: 19789 [2019-12-07 13:01:27,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:01:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19789 states. [2019-12-07 13:01:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19789 to 18166. [2019-12-07 13:01:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18166 states. [2019-12-07 13:01:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18166 states to 18166 states and 56345 transitions. [2019-12-07 13:01:28,000 INFO L78 Accepts]: Start accepts. Automaton has 18166 states and 56345 transitions. Word has length 67 [2019-12-07 13:01:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:28,000 INFO L462 AbstractCegarLoop]: Abstraction has 18166 states and 56345 transitions. [2019-12-07 13:01:28,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 13:01:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18166 states and 56345 transitions. [2019-12-07 13:01:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:28,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:28,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:28,016 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 6 times [2019-12-07 13:01:28,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:28,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841497805] [2019-12-07 13:01:28,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:28,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841497805] [2019-12-07 13:01:28,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:28,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:01:28,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093137923] [2019-12-07 13:01:28,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:01:28,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:28,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:01:28,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:01:28,168 INFO L87 Difference]: Start difference. First operand 18166 states and 56345 transitions. Second operand 12 states. [2019-12-07 13:01:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:29,652 INFO L93 Difference]: Finished difference Result 29148 states and 90058 transitions. [2019-12-07 13:01:29,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:01:29,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 13:01:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:29,696 INFO L225 Difference]: With dead ends: 29148 [2019-12-07 13:01:29,696 INFO L226 Difference]: Without dead ends: 25899 [2019-12-07 13:01:29,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:01:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25899 states. [2019-12-07 13:01:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25899 to 17964. [2019-12-07 13:01:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17964 states. [2019-12-07 13:01:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17964 states to 17964 states and 55726 transitions. [2019-12-07 13:01:30,027 INFO L78 Accepts]: Start accepts. Automaton has 17964 states and 55726 transitions. Word has length 67 [2019-12-07 13:01:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:30,027 INFO L462 AbstractCegarLoop]: Abstraction has 17964 states and 55726 transitions. [2019-12-07 13:01:30,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:01:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17964 states and 55726 transitions. [2019-12-07 13:01:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:30,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:30,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:30,043 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 7 times [2019-12-07 13:01:30,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:30,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521344586] [2019-12-07 13:01:30,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:30,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521344586] [2019-12-07 13:01:30,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:30,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:01:30,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027952790] [2019-12-07 13:01:30,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:01:30,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:01:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:01:30,161 INFO L87 Difference]: Start difference. First operand 17964 states and 55726 transitions. Second operand 12 states. [2019-12-07 13:01:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:31,826 INFO L93 Difference]: Finished difference Result 31785 states and 97664 transitions. [2019-12-07 13:01:31,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 13:01:31,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 13:01:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:31,858 INFO L225 Difference]: With dead ends: 31785 [2019-12-07 13:01:31,858 INFO L226 Difference]: Without dead ends: 27590 [2019-12-07 13:01:31,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:01:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-07 13:01:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 17892. [2019-12-07 13:01:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17892 states. [2019-12-07 13:01:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17892 states to 17892 states and 55322 transitions. [2019-12-07 13:01:32,198 INFO L78 Accepts]: Start accepts. Automaton has 17892 states and 55322 transitions. Word has length 67 [2019-12-07 13:01:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:32,199 INFO L462 AbstractCegarLoop]: Abstraction has 17892 states and 55322 transitions. [2019-12-07 13:01:32,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:01:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 17892 states and 55322 transitions. [2019-12-07 13:01:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:32,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:32,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:32,214 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 8 times [2019-12-07 13:01:32,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:32,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941263917] [2019-12-07 13:01:32,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:32,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941263917] [2019-12-07 13:01:32,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:32,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:01:32,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379124285] [2019-12-07 13:01:32,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:01:32,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:01:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:01:32,350 INFO L87 Difference]: Start difference. First operand 17892 states and 55322 transitions. Second operand 12 states. [2019-12-07 13:01:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:33,966 INFO L93 Difference]: Finished difference Result 28327 states and 86855 transitions. [2019-12-07 13:01:33,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:01:33,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 13:01:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:34,009 INFO L225 Difference]: With dead ends: 28327 [2019-12-07 13:01:34,009 INFO L226 Difference]: Without dead ends: 27100 [2019-12-07 13:01:34,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:01:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27100 states. [2019-12-07 13:01:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27100 to 17812. [2019-12-07 13:01:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17812 states. [2019-12-07 13:01:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17812 states to 17812 states and 55102 transitions. [2019-12-07 13:01:34,346 INFO L78 Accepts]: Start accepts. Automaton has 17812 states and 55102 transitions. Word has length 67 [2019-12-07 13:01:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:34,346 INFO L462 AbstractCegarLoop]: Abstraction has 17812 states and 55102 transitions. [2019-12-07 13:01:34,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:01:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 17812 states and 55102 transitions. [2019-12-07 13:01:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:34,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:34,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:34,362 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1867129146, now seen corresponding path program 9 times [2019-12-07 13:01:34,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:34,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792978498] [2019-12-07 13:01:34,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:34,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792978498] [2019-12-07 13:01:34,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:34,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:01:34,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044537534] [2019-12-07 13:01:34,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:01:34,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:01:34,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:01:34,411 INFO L87 Difference]: Start difference. First operand 17812 states and 55102 transitions. Second operand 6 states. [2019-12-07 13:01:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:34,737 INFO L93 Difference]: Finished difference Result 45740 states and 140617 transitions. [2019-12-07 13:01:34,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:01:34,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-07 13:01:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:34,778 INFO L225 Difference]: With dead ends: 45740 [2019-12-07 13:01:34,778 INFO L226 Difference]: Without dead ends: 36038 [2019-12-07 13:01:34,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:01:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36038 states. [2019-12-07 13:01:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36038 to 18664. [2019-12-07 13:01:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18664 states. [2019-12-07 13:01:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18664 states to 18664 states and 57759 transitions. [2019-12-07 13:01:35,179 INFO L78 Accepts]: Start accepts. Automaton has 18664 states and 57759 transitions. Word has length 67 [2019-12-07 13:01:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:35,179 INFO L462 AbstractCegarLoop]: Abstraction has 18664 states and 57759 transitions. [2019-12-07 13:01:35,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:01:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18664 states and 57759 transitions. [2019-12-07 13:01:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:01:35,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:35,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:35,195 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 10 times [2019-12-07 13:01:35,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:35,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17555543] [2019-12-07 13:01:35,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:01:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:01:35,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:01:35,287 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:01:35,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1573~0.base_23|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_23|) |v_ULTIMATE.start_main_~#t1573~0.offset_17| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= |v_ULTIMATE.start_main_~#t1573~0.offset_17| 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1573~0.base_23| 4) |v_#length_21|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (select .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_23|) 0) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_23| 1)) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_14|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t1573~0.base=|v_ULTIMATE.start_main_~#t1573~0.base_23|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ULTIMATE.start_main_~#t1573~0.offset=|v_ULTIMATE.start_main_~#t1573~0.offset_17|, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1574~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1574~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1573~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1573~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1575~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:01:35,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1574~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1574~0.offset_9| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1574~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11|) |v_ULTIMATE.start_main_~#t1574~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1574~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1574~0.base, #length, ULTIMATE.start_main_~#t1574~0.offset] because there is no mapped edge [2019-12-07 13:01:35,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:01:35,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1500091116 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1500091116 256) 0))) (or (and (= ~z$w_buff1~0_In-1500091116 |P1Thread1of1ForFork2_#t~ite9_Out-1500091116|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1500091116 |P1Thread1of1ForFork2_#t~ite9_Out-1500091116|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1500091116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1500091116, ~z$w_buff1~0=~z$w_buff1~0_In-1500091116, ~z~0=~z~0_In-1500091116} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1500091116|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1500091116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1500091116, ~z$w_buff1~0=~z$w_buff1~0_In-1500091116, ~z~0=~z~0_In-1500091116} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 13:01:35,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 13:01:35,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1575~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1575~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1575~0.base_13|) (= |v_ULTIMATE.start_main_~#t1575~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13|) |v_ULTIMATE.start_main_~#t1575~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_~#t1575~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 13:01:35,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1484602651 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1484602651 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1484602651| ~z$w_buff0_used~0_In1484602651) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1484602651| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484602651, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484602651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484602651, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1484602651|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484602651} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:01:35,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-490842736 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-490842736 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-490842736 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-490842736 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-490842736| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-490842736 |P1Thread1of1ForFork2_#t~ite12_Out-490842736|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-490842736, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490842736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490842736, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-490842736} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-490842736, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490842736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490842736, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-490842736|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-490842736} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 13:01:35,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-312449153 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-312449153 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-312449153| ~z$r_buff0_thd2~0_In-312449153)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-312449153| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-312449153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-312449153|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-312449153} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 13:01:35,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1851830422 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1851830422 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In1851830422 256) 0) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1851830422 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1851830422 256)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out1851830422| ~z$w_buff0_used~0_In1851830422) (= |P2Thread1of1ForFork0_#t~ite26_Out1851830422| |P2Thread1of1ForFork0_#t~ite27_Out1851830422|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In1851830422| |P2Thread1of1ForFork0_#t~ite26_Out1851830422|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1851830422| ~z$w_buff0_used~0_In1851830422)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1851830422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1851830422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1851830422, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1851830422, ~weak$$choice2~0=~weak$$choice2~0_In1851830422} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1851830422|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1851830422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1851830422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1851830422, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1851830422, ~weak$$choice2~0=~weak$$choice2~0_In1851830422} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 13:01:35,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:01:35,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1527361123 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1527361123 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1527361123| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1527361123 |P0Thread1of1ForFork1_#t~ite5_Out-1527361123|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1527361123, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1527361123} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1527361123|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1527361123, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1527361123} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 13:01:35,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:01:35,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1591910011 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1591910011 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out1591910011| |P2Thread1of1ForFork0_#t~ite38_Out1591910011|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1591910011| ~z$w_buff1~0_In1591910011) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~z~0_In1591910011 |P2Thread1of1ForFork0_#t~ite38_Out1591910011|) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1591910011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591910011, ~z$w_buff1~0=~z$w_buff1~0_In1591910011, ~z~0=~z~0_In1591910011} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1591910011|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1591910011|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1591910011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591910011, ~z$w_buff1~0=~z$w_buff1~0_In1591910011, ~z~0=~z~0_In1591910011} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:01:35,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1976033204 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1976033204 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1976033204|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1976033204 |P2Thread1of1ForFork0_#t~ite40_Out-1976033204|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976033204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976033204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976033204, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1976033204|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976033204} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 13:01:35,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1366225039 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1366225039 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1366225039 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1366225039 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1366225039 |P2Thread1of1ForFork0_#t~ite41_Out1366225039|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1366225039|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1366225039, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1366225039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1366225039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1366225039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1366225039, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1366225039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1366225039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1366225039, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1366225039|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 13:01:35,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-889150515 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-889150515 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-889150515|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-889150515| ~z$r_buff0_thd3~0_In-889150515) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-889150515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889150515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-889150515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889150515, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-889150515|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:01:35,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1402410507 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1402410507 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1402410507 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1402410507 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1402410507|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1402410507 |P2Thread1of1ForFork0_#t~ite43_Out-1402410507|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1402410507, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1402410507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1402410507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1402410507} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1402410507|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1402410507, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1402410507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1402410507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1402410507} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 13:01:35,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:01:35,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1885753882 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1885753882 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1885753882 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1885753882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1885753882| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1885753882| ~z$w_buff1_used~0_In1885753882) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1885753882, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1885753882} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1885753882, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1885753882|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1885753882} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 13:01:35,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1327560572 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1327560572 256))) (.cse2 (= ~z$r_buff0_thd1~0_In1327560572 ~z$r_buff0_thd1~0_Out1327560572))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1327560572)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1327560572, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1327560572} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1327560572, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1327560572|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1327560572} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:01:35,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In908748135 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In908748135 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In908748135 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In908748135 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out908748135|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out908748135| ~z$r_buff1_thd1~0_In908748135) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In908748135, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In908748135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908748135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In908748135} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out908748135|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908748135, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In908748135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908748135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In908748135} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:01:35,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:01:35,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1484081150 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1484081150 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1484081150 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1484081150 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1484081150| ~z$r_buff1_thd2~0_In1484081150)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out1484081150| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1484081150|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:01:35,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:01:35,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:01:35,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-1642538921| |ULTIMATE.start_main_#t~ite48_Out-1642538921|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1642538921 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1642538921 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1642538921| ~z$w_buff1~0_In-1642538921)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1642538921| ~z~0_In-1642538921)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1642538921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1642538921, ~z$w_buff1~0=~z$w_buff1~0_In-1642538921, ~z~0=~z~0_In-1642538921} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1642538921, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1642538921|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1642538921, ~z$w_buff1~0=~z$w_buff1~0_In-1642538921, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1642538921|, ~z~0=~z~0_In-1642538921} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:01:35,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-405469233 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-405469233 256)))) (or (and (= ~z$w_buff0_used~0_In-405469233 |ULTIMATE.start_main_#t~ite49_Out-405469233|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-405469233|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-405469233, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-405469233} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-405469233, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-405469233, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-405469233|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:01:35,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In22202349 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In22202349 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In22202349 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In22202349 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In22202349 |ULTIMATE.start_main_#t~ite50_Out22202349|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out22202349|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In22202349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In22202349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In22202349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In22202349} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out22202349|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In22202349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In22202349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In22202349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In22202349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:01:35,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In582057751 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In582057751 256)))) (or (and (= ~z$r_buff0_thd0~0_In582057751 |ULTIMATE.start_main_#t~ite51_Out582057751|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out582057751| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In582057751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In582057751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In582057751, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out582057751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In582057751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:01:35,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1135078191 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1135078191 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1135078191 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1135078191 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1135078191| ~z$r_buff1_thd0~0_In-1135078191) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1135078191| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1135078191, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135078191, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1135078191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1135078191} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1135078191|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1135078191, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135078191, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1135078191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1135078191} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:01:35,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:01:35,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:01:35 BasicIcfg [2019-12-07 13:01:35,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:01:35,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:01:35,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:01:35,358 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:01:35,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:22" (3/4) ... [2019-12-07 13:01:35,360 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:01:35,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1573~0.base_23|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_23|) |v_ULTIMATE.start_main_~#t1573~0.offset_17| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= |v_ULTIMATE.start_main_~#t1573~0.offset_17| 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1573~0.base_23| 4) |v_#length_21|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (select .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_23|) 0) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_23| 1)) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_14|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t1573~0.base=|v_ULTIMATE.start_main_~#t1573~0.base_23|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ULTIMATE.start_main_~#t1573~0.offset=|v_ULTIMATE.start_main_~#t1573~0.offset_17|, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1574~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1574~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1573~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1573~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1575~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:01:35,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1574~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1574~0.offset_9| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1574~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11|) |v_ULTIMATE.start_main_~#t1574~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1574~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1574~0.base, #length, ULTIMATE.start_main_~#t1574~0.offset] because there is no mapped edge [2019-12-07 13:01:35,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:01:35,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1500091116 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1500091116 256) 0))) (or (and (= ~z$w_buff1~0_In-1500091116 |P1Thread1of1ForFork2_#t~ite9_Out-1500091116|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1500091116 |P1Thread1of1ForFork2_#t~ite9_Out-1500091116|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1500091116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1500091116, ~z$w_buff1~0=~z$w_buff1~0_In-1500091116, ~z~0=~z~0_In-1500091116} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1500091116|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1500091116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1500091116, ~z$w_buff1~0=~z$w_buff1~0_In-1500091116, ~z~0=~z~0_In-1500091116} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 13:01:35,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 13:01:35,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1575~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1575~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1575~0.base_13|) (= |v_ULTIMATE.start_main_~#t1575~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13|) |v_ULTIMATE.start_main_~#t1575~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_~#t1575~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 13:01:35,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1484602651 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1484602651 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1484602651| ~z$w_buff0_used~0_In1484602651) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1484602651| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484602651, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484602651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484602651, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1484602651|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484602651} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:01:35,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-490842736 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-490842736 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-490842736 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-490842736 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-490842736| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-490842736 |P1Thread1of1ForFork2_#t~ite12_Out-490842736|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-490842736, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490842736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490842736, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-490842736} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-490842736, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490842736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490842736, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-490842736|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-490842736} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 13:01:35,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-312449153 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-312449153 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-312449153| ~z$r_buff0_thd2~0_In-312449153)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-312449153| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-312449153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-312449153|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-312449153} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 13:01:35,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1851830422 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1851830422 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In1851830422 256) 0) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1851830422 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1851830422 256)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out1851830422| ~z$w_buff0_used~0_In1851830422) (= |P2Thread1of1ForFork0_#t~ite26_Out1851830422| |P2Thread1of1ForFork0_#t~ite27_Out1851830422|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In1851830422| |P2Thread1of1ForFork0_#t~ite26_Out1851830422|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1851830422| ~z$w_buff0_used~0_In1851830422)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1851830422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1851830422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1851830422, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1851830422, ~weak$$choice2~0=~weak$$choice2~0_In1851830422} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1851830422|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1851830422|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1851830422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1851830422, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1851830422, ~weak$$choice2~0=~weak$$choice2~0_In1851830422} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 13:01:35,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:01:35,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1527361123 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1527361123 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1527361123| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1527361123 |P0Thread1of1ForFork1_#t~ite5_Out-1527361123|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1527361123, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1527361123} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1527361123|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1527361123, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1527361123} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 13:01:35,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:01:35,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1591910011 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1591910011 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out1591910011| |P2Thread1of1ForFork0_#t~ite38_Out1591910011|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1591910011| ~z$w_buff1~0_In1591910011) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~z~0_In1591910011 |P2Thread1of1ForFork0_#t~ite38_Out1591910011|) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1591910011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591910011, ~z$w_buff1~0=~z$w_buff1~0_In1591910011, ~z~0=~z~0_In1591910011} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1591910011|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1591910011|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1591910011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591910011, ~z$w_buff1~0=~z$w_buff1~0_In1591910011, ~z~0=~z~0_In1591910011} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:01:35,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1976033204 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1976033204 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1976033204|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1976033204 |P2Thread1of1ForFork0_#t~ite40_Out-1976033204|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976033204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976033204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976033204, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1976033204|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976033204} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 13:01:35,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1366225039 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1366225039 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1366225039 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1366225039 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1366225039 |P2Thread1of1ForFork0_#t~ite41_Out1366225039|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1366225039|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1366225039, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1366225039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1366225039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1366225039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1366225039, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1366225039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1366225039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1366225039, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1366225039|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 13:01:35,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-889150515 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-889150515 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-889150515|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-889150515| ~z$r_buff0_thd3~0_In-889150515) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-889150515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889150515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-889150515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889150515, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-889150515|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:01:35,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1402410507 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1402410507 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1402410507 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1402410507 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1402410507|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1402410507 |P2Thread1of1ForFork0_#t~ite43_Out-1402410507|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1402410507, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1402410507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1402410507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1402410507} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1402410507|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1402410507, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1402410507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1402410507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1402410507} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 13:01:35,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:01:35,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1885753882 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1885753882 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1885753882 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1885753882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1885753882| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1885753882| ~z$w_buff1_used~0_In1885753882) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1885753882, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1885753882} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1885753882, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1885753882|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1885753882} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 13:01:35,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1327560572 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1327560572 256))) (.cse2 (= ~z$r_buff0_thd1~0_In1327560572 ~z$r_buff0_thd1~0_Out1327560572))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1327560572)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1327560572, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1327560572} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1327560572, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1327560572|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1327560572} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:01:35,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In908748135 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In908748135 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In908748135 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In908748135 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out908748135|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out908748135| ~z$r_buff1_thd1~0_In908748135) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In908748135, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In908748135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908748135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In908748135} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out908748135|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908748135, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In908748135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908748135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In908748135} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:01:35,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:01:35,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1484081150 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1484081150 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1484081150 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1484081150 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1484081150| ~z$r_buff1_thd2~0_In1484081150)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out1484081150| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1484081150|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:01:35,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:01:35,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:01:35,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-1642538921| |ULTIMATE.start_main_#t~ite48_Out-1642538921|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1642538921 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1642538921 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1642538921| ~z$w_buff1~0_In-1642538921)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1642538921| ~z~0_In-1642538921)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1642538921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1642538921, ~z$w_buff1~0=~z$w_buff1~0_In-1642538921, ~z~0=~z~0_In-1642538921} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1642538921, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1642538921|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1642538921, ~z$w_buff1~0=~z$w_buff1~0_In-1642538921, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1642538921|, ~z~0=~z~0_In-1642538921} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:01:35,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-405469233 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-405469233 256)))) (or (and (= ~z$w_buff0_used~0_In-405469233 |ULTIMATE.start_main_#t~ite49_Out-405469233|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-405469233|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-405469233, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-405469233} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-405469233, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-405469233, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-405469233|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:01:35,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In22202349 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In22202349 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In22202349 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In22202349 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In22202349 |ULTIMATE.start_main_#t~ite50_Out22202349|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out22202349|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In22202349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In22202349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In22202349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In22202349} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out22202349|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In22202349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In22202349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In22202349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In22202349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:01:35,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In582057751 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In582057751 256)))) (or (and (= ~z$r_buff0_thd0~0_In582057751 |ULTIMATE.start_main_#t~ite51_Out582057751|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out582057751| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In582057751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In582057751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In582057751, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out582057751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In582057751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:01:35,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1135078191 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1135078191 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1135078191 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1135078191 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1135078191| ~z$r_buff1_thd0~0_In-1135078191) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1135078191| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1135078191, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135078191, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1135078191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1135078191} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1135078191|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1135078191, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135078191, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1135078191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1135078191} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:01:35,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:01:35,428 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_835329c3-a8e2-4de8-83f1-175f08d5c281/bin/uautomizer/witness.graphml [2019-12-07 13:01:35,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:01:35,430 INFO L168 Benchmark]: Toolchain (without parser) took 133563.72 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 934.4 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:01:35,430 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:01:35,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:35,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:35,431 INFO L168 Benchmark]: Boogie Preprocessor took 27.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:01:35,431 INFO L168 Benchmark]: RCFGBuilder took 409.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:35,431 INFO L168 Benchmark]: TraceAbstraction took 132639.24 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 13:01:35,431 INFO L168 Benchmark]: Witness Printer took 70.47 ms. Allocated memory is still 8.1 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:35,433 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 132639.24 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 70.47 ms. Allocated memory is still 8.1 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1573, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1574, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1575, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 132.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6154 SDtfs, 6889 SDslu, 23777 SDs, 0 SdLazy, 19466 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237826occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 309625 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1023 ConstructedInterpolants, 0 QuantifiedInterpolants, 296393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...