./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_tso.opt.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_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/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 b9e766893b62b5c38d4242c3b92d89616e22bf8e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 14:59:00,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:59:00,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:59:00,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:59:00,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:59:00,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:59:00,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:59:00,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:59:00,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:59:00,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:59:00,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:59:00,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:59:00,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:59:00,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:59:00,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:59:00,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:59:00,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:59:00,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:59:00,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:59:00,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:59:00,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:59:00,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:59:00,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:59:00,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:59:00,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:59:00,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:59:00,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:59:00,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:59:00,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:59:00,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:59:00,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:59:00,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:59:00,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:59:00,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:59:00,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:59:00,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:59:00,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:59:00,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:59:00,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:59:00,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:59:00,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:59:00,967 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:59:00,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:59:00,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:59:00,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:59:00,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:59:00,978 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:59:00,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:59:00,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:59:00,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:59:00,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:59:00,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:59:00,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:59:00,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:59:00,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:59:00,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:59:00,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:59:00,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:59:00,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:59:00,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:59:00,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:59:00,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:59:00,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:59:00,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:59:00,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:59:00,981 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_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/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 -> b9e766893b62b5c38d4242c3b92d89616e22bf8e [2019-12-07 14:59:01,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:59:01,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:59:01,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:59:01,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:59:01,091 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:59:01,092 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix017_tso.opt.i [2019-12-07 14:59:01,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/data/a21a09d3f/85dfa9be5a14493484f2d2ce81292a20/FLAGd2960604a [2019-12-07 14:59:01,611 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:59:01,612 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/sv-benchmarks/c/pthread-wmm/mix017_tso.opt.i [2019-12-07 14:59:01,622 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/data/a21a09d3f/85dfa9be5a14493484f2d2ce81292a20/FLAGd2960604a [2019-12-07 14:59:02,115 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/data/a21a09d3f/85dfa9be5a14493484f2d2ce81292a20 [2019-12-07 14:59:02,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:59:02,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:59:02,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:59:02,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:59:02,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:59:02,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02, skipping insertion in model container [2019-12-07 14:59:02,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:59:02,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:59:02,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:59:02,472 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:59:02,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:59:02,593 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:59:02,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02 WrapperNode [2019-12-07 14:59:02,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:59:02,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:59:02,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:59:02,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:59:02,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:59:02,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:59:02,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:59:02,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:59:02,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... [2019-12-07 14:59:02,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:59:02,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:59:02,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:59:02,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:59:02,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/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 14:59:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:59:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:59:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:59:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:59:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:59:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:59:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:59:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:59:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:59:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:59:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 14:59:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 14:59:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:59:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:59:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:59:02,713 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 14:59:03,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:59:03,107 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:59:03,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:59:03 BoogieIcfgContainer [2019-12-07 14:59:03,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:59:03,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:59:03,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:59:03,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:59:03,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:59:02" (1/3) ... [2019-12-07 14:59:03,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728f195e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:59:03, skipping insertion in model container [2019-12-07 14:59:03,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:59:02" (2/3) ... [2019-12-07 14:59:03,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728f195e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:59:03, skipping insertion in model container [2019-12-07 14:59:03,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:59:03" (3/3) ... [2019-12-07 14:59:03,113 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_tso.opt.i [2019-12-07 14:59:03,119 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:59:03,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:59:03,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:59:03,124 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:59:03,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,165 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:59:03,189 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 14:59:03,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:59:03,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:59:03,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:59:03,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:59:03,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:59:03,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:59:03,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:59:03,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:59:03,213 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 14:59:03,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 14:59:03,280 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 14:59:03,280 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:59:03,293 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 943 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 14:59:03,316 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 14:59:03,354 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 14:59:03,354 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:59:03,363 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 943 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 14:59:03,389 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 14:59:03,389 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:59:07,287 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 14:59:07,474 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 14:59:07,592 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128453 [2019-12-07 14:59:07,592 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 14:59:07,595 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 133 transitions [2019-12-07 14:59:16,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92694 states. [2019-12-07 14:59:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 92694 states. [2019-12-07 14:59:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:59:16,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:16,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:16,411 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 289800420, now seen corresponding path program 1 times [2019-12-07 14:59:16,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:16,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304590098] [2019-12-07 14:59:16,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:16,573 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 14:59:16,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304590098] [2019-12-07 14:59:16,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:16,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:59:16,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203654403] [2019-12-07 14:59:16,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:16,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:16,588 INFO L87 Difference]: Start difference. First operand 92694 states. Second operand 3 states. [2019-12-07 14:59:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:17,291 INFO L93 Difference]: Finished difference Result 91926 states and 423356 transitions. [2019-12-07 14:59:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:17,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:59:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:17,771 INFO L225 Difference]: With dead ends: 91926 [2019-12-07 14:59:17,771 INFO L226 Difference]: Without dead ends: 86046 [2019-12-07 14:59:17,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 14:59:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86046 states. [2019-12-07 14:59:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86046 to 86046. [2019-12-07 14:59:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86046 states. [2019-12-07 14:59:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86046 states to 86046 states and 396028 transitions. [2019-12-07 14:59:20,953 INFO L78 Accepts]: Start accepts. Automaton has 86046 states and 396028 transitions. Word has length 9 [2019-12-07 14:59:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 86046 states and 396028 transitions. [2019-12-07 14:59:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 86046 states and 396028 transitions. [2019-12-07 14:59:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:59:20,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:20,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:20,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2034236290, now seen corresponding path program 1 times [2019-12-07 14:59:20,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:20,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241221068] [2019-12-07 14:59:20,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:21,021 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 14:59:21,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241221068] [2019-12-07 14:59:21,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:21,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:21,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571444882] [2019-12-07 14:59:21,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:21,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:21,024 INFO L87 Difference]: Start difference. First operand 86046 states and 396028 transitions. Second operand 4 states. [2019-12-07 14:59:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:23,422 INFO L93 Difference]: Finished difference Result 133470 states and 593512 transitions. [2019-12-07 14:59:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:23,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 14:59:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:23,880 INFO L225 Difference]: With dead ends: 133470 [2019-12-07 14:59:23,881 INFO L226 Difference]: Without dead ends: 133406 [2019-12-07 14:59:23,881 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 14:59:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133406 states. [2019-12-07 14:59:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133406 to 130674. [2019-12-07 14:59:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130674 states. [2019-12-07 14:59:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130674 states to 130674 states and 583548 transitions. [2019-12-07 14:59:27,947 INFO L78 Accepts]: Start accepts. Automaton has 130674 states and 583548 transitions. Word has length 15 [2019-12-07 14:59:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:27,948 INFO L462 AbstractCegarLoop]: Abstraction has 130674 states and 583548 transitions. [2019-12-07 14:59:27,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 130674 states and 583548 transitions. [2019-12-07 14:59:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:59:27,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:27,955 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 14:59:27,955 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:27,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2071108343, now seen corresponding path program 1 times [2019-12-07 14:59:27,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:27,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966539256] [2019-12-07 14:59:27,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:28,004 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 14:59:28,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966539256] [2019-12-07 14:59:28,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:28,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:28,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750523408] [2019-12-07 14:59:28,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:28,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:28,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:28,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:28,006 INFO L87 Difference]: Start difference. First operand 130674 states and 583548 transitions. Second operand 4 states. [2019-12-07 14:59:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:29,461 INFO L93 Difference]: Finished difference Result 168598 states and 742916 transitions. [2019-12-07 14:59:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:59:29,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:59:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:29,914 INFO L225 Difference]: With dead ends: 168598 [2019-12-07 14:59:29,914 INFO L226 Difference]: Without dead ends: 168538 [2019-12-07 14:59:29,915 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 14:59:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168538 states. [2019-12-07 14:59:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168538 to 150690. [2019-12-07 14:59:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150690 states. [2019-12-07 14:59:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150690 states to 150690 states and 669704 transitions. [2019-12-07 14:59:36,313 INFO L78 Accepts]: Start accepts. Automaton has 150690 states and 669704 transitions. Word has length 18 [2019-12-07 14:59:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:36,313 INFO L462 AbstractCegarLoop]: Abstraction has 150690 states and 669704 transitions. [2019-12-07 14:59:36,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 150690 states and 669704 transitions. [2019-12-07 14:59:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:59:36,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:36,329 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] [2019-12-07 14:59:36,329 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1489223162, now seen corresponding path program 1 times [2019-12-07 14:59:36,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:36,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269181046] [2019-12-07 14:59:36,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:36,375 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 14:59:36,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269181046] [2019-12-07 14:59:36,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:36,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:36,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198059548] [2019-12-07 14:59:36,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:36,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:36,376 INFO L87 Difference]: Start difference. First operand 150690 states and 669704 transitions. Second operand 3 states. [2019-12-07 14:59:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:37,443 INFO L93 Difference]: Finished difference Result 142482 states and 626424 transitions. [2019-12-07 14:59:37,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:37,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:59:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:37,819 INFO L225 Difference]: With dead ends: 142482 [2019-12-07 14:59:37,819 INFO L226 Difference]: Without dead ends: 142482 [2019-12-07 14:59:37,819 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 14:59:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142482 states. [2019-12-07 14:59:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142482 to 142098. [2019-12-07 14:59:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142098 states. [2019-12-07 14:59:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142098 states to 142098 states and 625016 transitions. [2019-12-07 14:59:42,084 INFO L78 Accepts]: Start accepts. Automaton has 142098 states and 625016 transitions. Word has length 20 [2019-12-07 14:59:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:42,084 INFO L462 AbstractCegarLoop]: Abstraction has 142098 states and 625016 transitions. [2019-12-07 14:59:42,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 142098 states and 625016 transitions. [2019-12-07 14:59:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:59:42,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:42,093 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] [2019-12-07 14:59:42,093 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1153296933, now seen corresponding path program 1 times [2019-12-07 14:59:42,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:42,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959009136] [2019-12-07 14:59:42,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:42,168 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 14:59:42,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959009136] [2019-12-07 14:59:42,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:42,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:59:42,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304050849] [2019-12-07 14:59:42,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:59:42,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:59:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:59:42,169 INFO L87 Difference]: Start difference. First operand 142098 states and 625016 transitions. Second operand 3 states. [2019-12-07 14:59:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:42,850 INFO L93 Difference]: Finished difference Result 140286 states and 614401 transitions. [2019-12-07 14:59:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:42,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:59:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:43,229 INFO L225 Difference]: With dead ends: 140286 [2019-12-07 14:59:43,229 INFO L226 Difference]: Without dead ends: 140286 [2019-12-07 14:59:43,229 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 14:59:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140286 states. [2019-12-07 14:59:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140286 to 140142. [2019-12-07 14:59:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140142 states. [2019-12-07 14:59:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140142 states to 140142 states and 614071 transitions. [2019-12-07 14:59:49,197 INFO L78 Accepts]: Start accepts. Automaton has 140142 states and 614071 transitions. Word has length 20 [2019-12-07 14:59:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:49,198 INFO L462 AbstractCegarLoop]: Abstraction has 140142 states and 614071 transitions. [2019-12-07 14:59:49,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:59:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 140142 states and 614071 transitions. [2019-12-07 14:59:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:59:49,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:49,208 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] [2019-12-07 14:59:49,208 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:49,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash 706885106, now seen corresponding path program 1 times [2019-12-07 14:59:49,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:49,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84476926] [2019-12-07 14:59:49,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:49,270 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 14:59:49,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84476926] [2019-12-07 14:59:49,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:49,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:59:49,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333811553] [2019-12-07 14:59:49,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:59:49,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:59:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:59:49,271 INFO L87 Difference]: Start difference. First operand 140142 states and 614071 transitions. Second operand 4 states. [2019-12-07 14:59:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:50,311 INFO L93 Difference]: Finished difference Result 133566 states and 586236 transitions. [2019-12-07 14:59:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:59:50,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 14:59:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:50,650 INFO L225 Difference]: With dead ends: 133566 [2019-12-07 14:59:50,650 INFO L226 Difference]: Without dead ends: 133566 [2019-12-07 14:59:50,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 14:59:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133566 states. [2019-12-07 14:59:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133566 to 133566. [2019-12-07 14:59:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133566 states. [2019-12-07 14:59:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133566 states to 133566 states and 586236 transitions. [2019-12-07 14:59:54,730 INFO L78 Accepts]: Start accepts. Automaton has 133566 states and 586236 transitions. Word has length 21 [2019-12-07 14:59:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:54,731 INFO L462 AbstractCegarLoop]: Abstraction has 133566 states and 586236 transitions. [2019-12-07 14:59:54,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:59:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 133566 states and 586236 transitions. [2019-12-07 14:59:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:59:54,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:54,755 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] [2019-12-07 14:59:54,755 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1819593063, now seen corresponding path program 1 times [2019-12-07 14:59:54,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:59:54,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955823832] [2019-12-07 14:59:54,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:54,806 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 14:59:54,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955823832] [2019-12-07 14:59:54,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:54,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:59:54,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656616965] [2019-12-07 14:59:54,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:59:54,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:59:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:59:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:59:54,808 INFO L87 Difference]: Start difference. First operand 133566 states and 586236 transitions. Second operand 5 states. [2019-12-07 14:59:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:55,912 INFO L93 Difference]: Finished difference Result 159350 states and 692164 transitions. [2019-12-07 14:59:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:59:55,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 14:59:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:56,327 INFO L225 Difference]: With dead ends: 159350 [2019-12-07 14:59:56,327 INFO L226 Difference]: Without dead ends: 159238 [2019-12-07 14:59:56,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:59:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159238 states. [2019-12-07 15:00:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159238 to 133022. [2019-12-07 15:00:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133022 states. [2019-12-07 15:00:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133022 states to 133022 states and 583952 transitions. [2019-12-07 15:00:03,285 INFO L78 Accepts]: Start accepts. Automaton has 133022 states and 583952 transitions. Word has length 24 [2019-12-07 15:00:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:03,285 INFO L462 AbstractCegarLoop]: Abstraction has 133022 states and 583952 transitions. [2019-12-07 15:00:03,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:00:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 133022 states and 583952 transitions. [2019-12-07 15:00:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:00:03,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:03,411 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] [2019-12-07 15:00:03,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:03,412 INFO L82 PathProgramCache]: Analyzing trace with hash 61164366, now seen corresponding path program 1 times [2019-12-07 15:00:03,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:03,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528273194] [2019-12-07 15:00:03,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:03,497 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 15:00:03,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528273194] [2019-12-07 15:00:03,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:03,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:00:03,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039929690] [2019-12-07 15:00:03,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:00:03,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:03,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:00:03,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:03,499 INFO L87 Difference]: Start difference. First operand 133022 states and 583952 transitions. Second operand 8 states. [2019-12-07 15:00:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:05,647 INFO L93 Difference]: Finished difference Result 307290 states and 1345932 transitions. [2019-12-07 15:00:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 15:00:05,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 15:00:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:06,327 INFO L225 Difference]: With dead ends: 307290 [2019-12-07 15:00:06,327 INFO L226 Difference]: Without dead ends: 251270 [2019-12-07 15:00:06,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:00:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251270 states. [2019-12-07 15:00:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251270 to 212674. [2019-12-07 15:00:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212674 states. [2019-12-07 15:00:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212674 states to 212674 states and 941096 transitions. [2019-12-07 15:00:13,120 INFO L78 Accepts]: Start accepts. Automaton has 212674 states and 941096 transitions. Word has length 35 [2019-12-07 15:00:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:13,120 INFO L462 AbstractCegarLoop]: Abstraction has 212674 states and 941096 transitions. [2019-12-07 15:00:13,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:00:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 212674 states and 941096 transitions. [2019-12-07 15:00:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:00:13,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:13,363 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] [2019-12-07 15:00:13,363 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash 351096382, now seen corresponding path program 2 times [2019-12-07 15:00:13,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:13,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151390869] [2019-12-07 15:00:13,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:13,520 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 15:00:13,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151390869] [2019-12-07 15:00:13,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:13,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:00:13,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988239149] [2019-12-07 15:00:13,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:00:13,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:00:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:00:13,521 INFO L87 Difference]: Start difference. First operand 212674 states and 941096 transitions. Second operand 11 states. [2019-12-07 15:00:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:16,282 INFO L93 Difference]: Finished difference Result 284966 states and 1269088 transitions. [2019-12-07 15:00:16,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:00:16,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-12-07 15:00:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:17,038 INFO L225 Difference]: With dead ends: 284966 [2019-12-07 15:00:17,038 INFO L226 Difference]: Without dead ends: 268550 [2019-12-07 15:00:17,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2019-12-07 15:00:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268550 states. [2019-12-07 15:00:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268550 to 213362. [2019-12-07 15:00:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213362 states. [2019-12-07 15:00:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213362 states to 213362 states and 944480 transitions. [2019-12-07 15:00:26,485 INFO L78 Accepts]: Start accepts. Automaton has 213362 states and 944480 transitions. Word has length 35 [2019-12-07 15:00:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:26,485 INFO L462 AbstractCegarLoop]: Abstraction has 213362 states and 944480 transitions. [2019-12-07 15:00:26,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:00:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 213362 states and 944480 transitions. [2019-12-07 15:00:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:00:26,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:26,719 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] [2019-12-07 15:00:26,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 572829278, now seen corresponding path program 3 times [2019-12-07 15:00:26,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:26,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080134635] [2019-12-07 15:00:26,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:26,795 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 15:00:26,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080134635] [2019-12-07 15:00:26,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:26,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:00:26,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471036487] [2019-12-07 15:00:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:00:26,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:00:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:00:26,797 INFO L87 Difference]: Start difference. First operand 213362 states and 944480 transitions. Second operand 9 states. [2019-12-07 15:00:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:29,528 INFO L93 Difference]: Finished difference Result 341230 states and 1509112 transitions. [2019-12-07 15:00:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 15:00:29,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 15:00:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:30,467 INFO L225 Difference]: With dead ends: 341230 [2019-12-07 15:00:30,467 INFO L226 Difference]: Without dead ends: 322350 [2019-12-07 15:00:30,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:00:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322350 states. [2019-12-07 15:00:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322350 to 216438. [2019-12-07 15:00:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216438 states. [2019-12-07 15:00:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216438 states to 216438 states and 958636 transitions. [2019-12-07 15:00:41,164 INFO L78 Accepts]: Start accepts. Automaton has 216438 states and 958636 transitions. Word has length 35 [2019-12-07 15:00:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:41,164 INFO L462 AbstractCegarLoop]: Abstraction has 216438 states and 958636 transitions. [2019-12-07 15:00:41,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:00:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 216438 states and 958636 transitions. [2019-12-07 15:00:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 15:00:41,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:41,419 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] [2019-12-07 15:00:41,419 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2063359088, now seen corresponding path program 1 times [2019-12-07 15:00:41,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:41,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576088407] [2019-12-07 15:00:41,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:41,457 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 15:00:41,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576088407] [2019-12-07 15:00:41,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:41,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:00:41,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368990038] [2019-12-07 15:00:41,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:00:41,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:41,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:00:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:00:41,458 INFO L87 Difference]: Start difference. First operand 216438 states and 958636 transitions. Second operand 3 states. [2019-12-07 15:00:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:42,695 INFO L93 Difference]: Finished difference Result 167092 states and 686270 transitions. [2019-12-07 15:00:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:00:42,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 15:00:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:43,086 INFO L225 Difference]: With dead ends: 167092 [2019-12-07 15:00:43,086 INFO L226 Difference]: Without dead ends: 167092 [2019-12-07 15:00:43,086 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 15:00:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167092 states. [2019-12-07 15:00:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167092 to 167092. [2019-12-07 15:00:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167092 states. [2019-12-07 15:00:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167092 states to 167092 states and 686270 transitions. [2019-12-07 15:00:47,589 INFO L78 Accepts]: Start accepts. Automaton has 167092 states and 686270 transitions. Word has length 36 [2019-12-07 15:00:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:47,589 INFO L462 AbstractCegarLoop]: Abstraction has 167092 states and 686270 transitions. [2019-12-07 15:00:47,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:00:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 167092 states and 686270 transitions. [2019-12-07 15:00:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:00:48,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:48,117 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] [2019-12-07 15:00:48,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1360611929, now seen corresponding path program 1 times [2019-12-07 15:00:48,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:48,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2295234] [2019-12-07 15:00:48,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:48,151 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 15:00:48,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2295234] [2019-12-07 15:00:48,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:48,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:00:48,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189718871] [2019-12-07 15:00:48,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:48,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:48,153 INFO L87 Difference]: Start difference. First operand 167092 states and 686270 transitions. Second operand 4 states. [2019-12-07 15:00:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:48,427 INFO L93 Difference]: Finished difference Result 67003 states and 234222 transitions. [2019-12-07 15:00:48,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:00:48,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 15:00:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:48,554 INFO L225 Difference]: With dead ends: 67003 [2019-12-07 15:00:48,554 INFO L226 Difference]: Without dead ends: 67003 [2019-12-07 15:00:48,555 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 15:00:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67003 states. [2019-12-07 15:00:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67003 to 67003. [2019-12-07 15:00:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67003 states. [2019-12-07 15:00:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67003 states to 67003 states and 234222 transitions. [2019-12-07 15:00:49,953 INFO L78 Accepts]: Start accepts. Automaton has 67003 states and 234222 transitions. Word has length 37 [2019-12-07 15:00:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:49,953 INFO L462 AbstractCegarLoop]: Abstraction has 67003 states and 234222 transitions. [2019-12-07 15:00:49,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:00:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67003 states and 234222 transitions. [2019-12-07 15:00:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 15:00:50,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:50,010 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] [2019-12-07 15:00:50,010 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1880281633, now seen corresponding path program 1 times [2019-12-07 15:00:50,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:50,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890893046] [2019-12-07 15:00:50,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:50,045 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 15:00:50,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890893046] [2019-12-07 15:00:50,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:50,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:00:50,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071359439] [2019-12-07 15:00:50,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:00:50,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:50,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:00:50,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:00:50,046 INFO L87 Difference]: Start difference. First operand 67003 states and 234222 transitions. Second operand 5 states. [2019-12-07 15:00:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:50,117 INFO L93 Difference]: Finished difference Result 14851 states and 51290 transitions. [2019-12-07 15:00:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:00:50,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 15:00:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:50,140 INFO L225 Difference]: With dead ends: 14851 [2019-12-07 15:00:50,140 INFO L226 Difference]: Without dead ends: 14851 [2019-12-07 15:00:50,141 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 15:00:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14851 states. [2019-12-07 15:00:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14851 to 13483. [2019-12-07 15:00:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13483 states. [2019-12-07 15:00:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13483 states to 13483 states and 46302 transitions. [2019-12-07 15:00:50,455 INFO L78 Accepts]: Start accepts. Automaton has 13483 states and 46302 transitions. Word has length 38 [2019-12-07 15:00:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:50,455 INFO L462 AbstractCegarLoop]: Abstraction has 13483 states and 46302 transitions. [2019-12-07 15:00:50,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:00:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13483 states and 46302 transitions. [2019-12-07 15:00:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:00:50,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:50,469 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] [2019-12-07 15:00:50,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 351395633, now seen corresponding path program 1 times [2019-12-07 15:00:50,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:50,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827775361] [2019-12-07 15:00:50,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:50,528 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 15:00:50,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827775361] [2019-12-07 15:00:50,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:50,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:00:50,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415114995] [2019-12-07 15:00:50,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:50,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:50,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:50,529 INFO L87 Difference]: Start difference. First operand 13483 states and 46302 transitions. Second operand 4 states. [2019-12-07 15:00:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:50,599 INFO L93 Difference]: Finished difference Result 15163 states and 50614 transitions. [2019-12-07 15:00:50,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:00:50,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 15:00:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:50,622 INFO L225 Difference]: With dead ends: 15163 [2019-12-07 15:00:50,622 INFO L226 Difference]: Without dead ends: 14972 [2019-12-07 15:00:50,622 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 15:00:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14972 states. [2019-12-07 15:00:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14972 to 14481. [2019-12-07 15:00:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14481 states. [2019-12-07 15:00:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14481 states to 14481 states and 48616 transitions. [2019-12-07 15:00:50,833 INFO L78 Accepts]: Start accepts. Automaton has 14481 states and 48616 transitions. Word has length 49 [2019-12-07 15:00:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:50,833 INFO L462 AbstractCegarLoop]: Abstraction has 14481 states and 48616 transitions. [2019-12-07 15:00:50,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:00:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14481 states and 48616 transitions. [2019-12-07 15:00:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:00:50,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:50,849 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] [2019-12-07 15:00:50,849 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1147193727, now seen corresponding path program 2 times [2019-12-07 15:00:50,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:50,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958114906] [2019-12-07 15:00:50,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:50,889 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 15:00:50,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958114906] [2019-12-07 15:00:50,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:50,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:00:50,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063190969] [2019-12-07 15:00:50,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:50,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:50,890 INFO L87 Difference]: Start difference. First operand 14481 states and 48616 transitions. Second operand 4 states. [2019-12-07 15:00:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:50,943 INFO L93 Difference]: Finished difference Result 16161 states and 52928 transitions. [2019-12-07 15:00:50,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:00:50,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 15:00:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:50,964 INFO L225 Difference]: With dead ends: 16161 [2019-12-07 15:00:50,964 INFO L226 Difference]: Without dead ends: 13489 [2019-12-07 15:00:50,964 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 15:00:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13489 states. [2019-12-07 15:00:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13489 to 13477. [2019-12-07 15:00:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13477 states. [2019-12-07 15:00:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 46167 transitions. [2019-12-07 15:00:51,159 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 46167 transitions. Word has length 49 [2019-12-07 15:00:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:51,160 INFO L462 AbstractCegarLoop]: Abstraction has 13477 states and 46167 transitions. [2019-12-07 15:00:51,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:00:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 46167 transitions. [2019-12-07 15:00:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:00:51,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:51,175 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] [2019-12-07 15:00:51,175 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash -314694133, now seen corresponding path program 3 times [2019-12-07 15:00:51,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:51,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079547541] [2019-12-07 15:00:51,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:51,240 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 15:00:51,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079547541] [2019-12-07 15:00:51,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:51,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:00:51,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245087878] [2019-12-07 15:00:51,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:51,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:51,241 INFO L87 Difference]: Start difference. First operand 13477 states and 46167 transitions. Second operand 4 states. [2019-12-07 15:00:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:51,321 INFO L93 Difference]: Finished difference Result 17831 states and 56915 transitions. [2019-12-07 15:00:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:00:51,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 15:00:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:51,346 INFO L225 Difference]: With dead ends: 17831 [2019-12-07 15:00:51,346 INFO L226 Difference]: Without dead ends: 17585 [2019-12-07 15:00:51,346 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 15:00:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17585 states. [2019-12-07 15:00:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17585 to 14434. [2019-12-07 15:00:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14434 states. [2019-12-07 15:00:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14434 states to 14434 states and 48345 transitions. [2019-12-07 15:00:51,566 INFO L78 Accepts]: Start accepts. Automaton has 14434 states and 48345 transitions. Word has length 49 [2019-12-07 15:00:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:51,567 INFO L462 AbstractCegarLoop]: Abstraction has 14434 states and 48345 transitions. [2019-12-07 15:00:51,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:00:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 14434 states and 48345 transitions. [2019-12-07 15:00:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:00:51,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:51,582 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] [2019-12-07 15:00:51,582 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1807969539, now seen corresponding path program 4 times [2019-12-07 15:00:51,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:51,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969297346] [2019-12-07 15:00:51,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:51,623 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 15:00:51,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969297346] [2019-12-07 15:00:51,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:51,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:00:51,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836439947] [2019-12-07 15:00:51,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:00:51,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:00:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:51,624 INFO L87 Difference]: Start difference. First operand 14434 states and 48345 transitions. Second operand 6 states. [2019-12-07 15:00:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:51,687 INFO L93 Difference]: Finished difference Result 12536 states and 43995 transitions. [2019-12-07 15:00:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:51,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 15:00:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:51,697 INFO L225 Difference]: With dead ends: 12536 [2019-12-07 15:00:51,698 INFO L226 Difference]: Without dead ends: 6576 [2019-12-07 15:00:51,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-12-07 15:00:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 6092. [2019-12-07 15:00:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6092 states. [2019-12-07 15:00:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 18804 transitions. [2019-12-07 15:00:51,778 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 18804 transitions. Word has length 49 [2019-12-07 15:00:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:51,779 INFO L462 AbstractCegarLoop]: Abstraction has 6092 states and 18804 transitions. [2019-12-07 15:00:51,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 18804 transitions. [2019-12-07 15:00:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:00:51,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:51,784 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] [2019-12-07 15:00:51,784 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash -228121426, now seen corresponding path program 1 times [2019-12-07 15:00:51,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:51,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420590767] [2019-12-07 15:00:51,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:51,851 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 15:00:51,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420590767] [2019-12-07 15:00:51,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:51,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:00:51,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404868425] [2019-12-07 15:00:51,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:00:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:00:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:00:51,853 INFO L87 Difference]: Start difference. First operand 6092 states and 18804 transitions. Second operand 5 states. [2019-12-07 15:00:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:51,905 INFO L93 Difference]: Finished difference Result 6613 states and 19978 transitions. [2019-12-07 15:00:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:00:51,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 15:00:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:51,912 INFO L225 Difference]: With dead ends: 6613 [2019-12-07 15:00:51,912 INFO L226 Difference]: Without dead ends: 4039 [2019-12-07 15:00:51,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2019-12-07 15:00:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 4039. [2019-12-07 15:00:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4039 states. [2019-12-07 15:00:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 11092 transitions. [2019-12-07 15:00:51,962 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 11092 transitions. Word has length 65 [2019-12-07 15:00:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:51,963 INFO L462 AbstractCegarLoop]: Abstraction has 4039 states and 11092 transitions. [2019-12-07 15:00:51,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:00:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 11092 transitions. [2019-12-07 15:00:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:00:51,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:51,966 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] [2019-12-07 15:00:51,966 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 563984448, now seen corresponding path program 2 times [2019-12-07 15:00:51,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:51,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727004663] [2019-12-07 15:00:51,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:52,204 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 15:00:52,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727004663] [2019-12-07 15:00:52,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:52,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:00:52,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122084469] [2019-12-07 15:00:52,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:00:52,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:00:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:00:52,205 INFO L87 Difference]: Start difference. First operand 4039 states and 11092 transitions. Second operand 10 states. [2019-12-07 15:00:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:53,110 INFO L93 Difference]: Finished difference Result 10383 states and 27878 transitions. [2019-12-07 15:00:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:00:53,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-07 15:00:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:53,117 INFO L225 Difference]: With dead ends: 10383 [2019-12-07 15:00:53,118 INFO L226 Difference]: Without dead ends: 7687 [2019-12-07 15:00:53,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:00:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7687 states. [2019-12-07 15:00:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7687 to 5642. [2019-12-07 15:00:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-07 15:00:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 15556 transitions. [2019-12-07 15:00:53,193 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 15556 transitions. Word has length 65 [2019-12-07 15:00:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:53,193 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 15556 transitions. [2019-12-07 15:00:53,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:00:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 15556 transitions. [2019-12-07 15:00:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:00:53,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:53,198 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] [2019-12-07 15:00:53,198 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 409594010, now seen corresponding path program 3 times [2019-12-07 15:00:53,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:53,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679345742] [2019-12-07 15:00:53,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:53,297 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 15:00:53,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679345742] [2019-12-07 15:00:53,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:53,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:00:53,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984862851] [2019-12-07 15:00:53,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:00:53,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:00:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:00:53,298 INFO L87 Difference]: Start difference. First operand 5642 states and 15556 transitions. Second operand 7 states. [2019-12-07 15:00:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:53,462 INFO L93 Difference]: Finished difference Result 12100 states and 33732 transitions. [2019-12-07 15:00:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:00:53,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 15:00:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:53,473 INFO L225 Difference]: With dead ends: 12100 [2019-12-07 15:00:53,473 INFO L226 Difference]: Without dead ends: 7564 [2019-12-07 15:00:53,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:00:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-12-07 15:00:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 5649. [2019-12-07 15:00:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5649 states. [2019-12-07 15:00:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 5649 states and 15482 transitions. [2019-12-07 15:00:53,545 INFO L78 Accepts]: Start accepts. Automaton has 5649 states and 15482 transitions. Word has length 65 [2019-12-07 15:00:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:53,546 INFO L462 AbstractCegarLoop]: Abstraction has 5649 states and 15482 transitions. [2019-12-07 15:00:53,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:00:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5649 states and 15482 transitions. [2019-12-07 15:00:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 15:00:53,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:53,550 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 15:00:53,550 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash 597015938, now seen corresponding path program 1 times [2019-12-07 15:00:53,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:53,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736747169] [2019-12-07 15:00:53,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:53,604 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 15:00:53,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736747169] [2019-12-07 15:00:53,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:53,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:00:53,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170961712] [2019-12-07 15:00:53,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:00:53,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:00:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:00:53,605 INFO L87 Difference]: Start difference. First operand 5649 states and 15482 transitions. Second operand 5 states. [2019-12-07 15:00:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:53,647 INFO L93 Difference]: Finished difference Result 6005 states and 16263 transitions. [2019-12-07 15:00:53,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:53,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 15:00:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:53,648 INFO L225 Difference]: With dead ends: 6005 [2019-12-07 15:00:53,648 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 15:00:53,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:00:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 15:00:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2019-12-07 15:00:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-12-07 15:00:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 999 transitions. [2019-12-07 15:00:53,653 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 999 transitions. Word has length 66 [2019-12-07 15:00:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:53,653 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 999 transitions. [2019-12-07 15:00:53,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:00:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 999 transitions. [2019-12-07 15:00:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 15:00:53,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:53,653 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 15:00:53,654 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -178600644, now seen corresponding path program 2 times [2019-12-07 15:00:53,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:53,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631038499] [2019-12-07 15:00:53,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:53,721 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 15:00:53,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631038499] [2019-12-07 15:00:53,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:53,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:00:53,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951084841] [2019-12-07 15:00:53,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:00:53,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:53,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:00:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:00:53,722 INFO L87 Difference]: Start difference. First operand 459 states and 999 transitions. Second operand 7 states. [2019-12-07 15:00:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:53,852 INFO L93 Difference]: Finished difference Result 830 states and 1779 transitions. [2019-12-07 15:00:53,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:00:53,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 15:00:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:53,853 INFO L225 Difference]: With dead ends: 830 [2019-12-07 15:00:53,853 INFO L226 Difference]: Without dead ends: 579 [2019-12-07 15:00:53,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:00:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-07 15:00:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 493. [2019-12-07 15:00:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-12-07 15:00:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1052 transitions. [2019-12-07 15:00:53,860 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1052 transitions. Word has length 66 [2019-12-07 15:00:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:53,860 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 1052 transitions. [2019-12-07 15:00:53,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:00:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1052 transitions. [2019-12-07 15:00:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 15:00:53,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:53,861 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 15:00:53,861 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1962010180, now seen corresponding path program 3 times [2019-12-07 15:00:53,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:53,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269140142] [2019-12-07 15:00:53,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:00:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:00:53,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:00:53,957 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:00:53,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] ULTIMATE.startENTRY-->L853: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= 0 |v_ULTIMATE.start_main_~#t461~0.offset_24|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd2~0_119 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd0~0_271 0) (= v_~z$r_buff0_thd1~0_119 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t461~0.base_34|) (= 0 v_~z$r_buff1_thd4~0_357) (= 0 v_~__unbuffered_p3_EBX~0_62) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~__unbuffered_p2_EAX~0_102) (= v_~z$w_buff1~0_242 0) (= v_~y~0_54 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t461~0.base_34| 4)) (= v_~main$tmp_guard1~0_57 0) (= 0 v_~z$flush_delayed~0_271) (= v_~main$tmp_guard0~0_23 0) (= v_~z$r_buff1_thd2~0_188 0) (= 0 v_~weak$$choice0~0_222) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff0_thd4~0_543) (= 0 v_~z$r_buff1_thd3~0_439) (= v_~weak$$choice2~0_319 0) (= v_~z$r_buff0_thd0~0_186 0) (= v_~z$w_buff0~0_347 0) (= v_~z$w_buff0_used~0_883 0) (= v_~z$read_delayed~0_7 0) (= v_~a~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t461~0.base_34|)) (= 0 v_~z$r_buff0_thd3~0_421) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_p3_EAX~0_85) (= v_~z$w_buff1_used~0_620 0) (= v_~z$r_buff1_thd1~0_188 0) (= v_~z~0_347 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t461~0.base_34| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t461~0.base_34|) |v_ULTIMATE.start_main_~#t461~0.offset_24| 0))) (= 0 v_~z$mem_tmp~0_234) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t461~0.base_34| 1)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ULTIMATE.start_main_~#t463~0.base=|v_ULTIMATE.start_main_~#t463~0.base_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_186, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_543, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_85, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~z$mem_tmp~0=v_~z$mem_tmp~0_234, ULTIMATE.start_main_~#t462~0.base=|v_ULTIMATE.start_main_~#t462~0.base_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ~z$flush_delayed~0=v_~z$flush_delayed~0_271, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_30|, ~weak$$choice0~0=v_~weak$$choice0~0_222, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_190|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_188, ~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_421, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t461~0.offset=|v_ULTIMATE.start_main_~#t461~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_357, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_22|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_242, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_57, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_271, ULTIMATE.start_main_~#t464~0.base=|v_ULTIMATE.start_main_~#t464~0.base_20|, ULTIMATE.start_main_~#t464~0.offset=|v_ULTIMATE.start_main_~#t464~0.offset_16|, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, ULTIMATE.start_main_~#t461~0.base=|v_ULTIMATE.start_main_~#t461~0.base_34|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_883, ~z$w_buff0~0=v_~z$w_buff0~0_347, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_439, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_78|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_62, ULTIMATE.start_main_~#t463~0.offset=|v_ULTIMATE.start_main_~#t463~0.offset_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_347, ~weak$$choice2~0=v_~weak$$choice2~0_319, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_119, ULTIMATE.start_main_~#t462~0.offset=|v_ULTIMATE.start_main_~#t462~0.offset_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t463~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t462~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t461~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t464~0.base, ULTIMATE.start_main_~#t464~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t461~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t463~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t462~0.offset] because there is no mapped edge [2019-12-07 15:00:53,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L853-1-->L855: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t462~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t462~0.base_13|) |v_ULTIMATE.start_main_~#t462~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t462~0.base_13| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t462~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t462~0.base_13|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t462~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t462~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t462~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, ULTIMATE.start_main_~#t462~0.base=|v_ULTIMATE.start_main_~#t462~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t462~0.offset=|v_ULTIMATE.start_main_~#t462~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t462~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t462~0.offset] because there is no mapped edge [2019-12-07 15:00:53,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L855-1-->L857: Formula: (and (= |v_ULTIMATE.start_main_~#t463~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t463~0.base_12|)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t463~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t463~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t463~0.base_12|) |v_ULTIMATE.start_main_~#t463~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t463~0.base_12| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t463~0.base_12|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t463~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_50|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_~#t463~0.offset=|v_ULTIMATE.start_main_~#t463~0.offset_11|, ULTIMATE.start_main_~#t463~0.base=|v_ULTIMATE.start_main_~#t463~0.base_12|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t463~0.offset, ULTIMATE.start_main_~#t463~0.base] because there is no mapped edge [2019-12-07 15:00:53,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L857-1-->L859: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t464~0.base_10| 4)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t464~0.base_10| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t464~0.base_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t464~0.base_10|)) (= 0 |v_ULTIMATE.start_main_~#t464~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t464~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t464~0.base_10|) |v_ULTIMATE.start_main_~#t464~0.offset_9| 3)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t464~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t464~0.base=|v_ULTIMATE.start_main_~#t464~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t464~0.offset=|v_ULTIMATE.start_main_~#t464~0.offset_9|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t464~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t464~0.offset, #length] because there is no mapped edge [2019-12-07 15:00:53,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_21) (= v_P3Thread1of1ForFork2_~arg.base_6 |v_P3Thread1of1ForFork2_#in~arg.base_8|) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_54 256) 0)) (not (= 0 (mod v_~z$w_buff0_used~0_94 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_94 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_8| v_P3Thread1of1ForFork2_~arg.offset_6) (= 1 v_~z$w_buff0~0_26) (= v_~z$w_buff0_used~0_95 v_~z$w_buff1_used~0_54)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_27, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_54, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, ~z$w_buff1~0=v_~z$w_buff1~0_21, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_6, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 15:00:53,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L815-2-->L815-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-957578960| |P3Thread1of1ForFork2_#t~ite28_Out-957578960|)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-957578960 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-957578960 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff0~0_In-957578960 |P3Thread1of1ForFork2_#t~ite28_Out-957578960|)) (and (= ~z$w_buff1~0_In-957578960 |P3Thread1of1ForFork2_#t~ite28_Out-957578960|) .cse2 (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-957578960, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-957578960, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-957578960, ~z$w_buff1~0=~z$w_buff1~0_In-957578960} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-957578960|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-957578960|, ~z$w_buff0~0=~z$w_buff0~0_In-957578960, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-957578960, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-957578960, ~z$w_buff1~0=~z$w_buff1~0_In-957578960} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 15:00:53,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (and (= v_~z$r_buff0_thd4~0_179 v_~z$r_buff0_thd4~0_180) (not (= (mod v_~weak$$choice2~0_104 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_104} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_179, ~weak$$choice2~0=v_~weak$$choice2~0_104} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:00:53,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1986679349 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1986679349| ~z$mem_tmp~0_In1986679349)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1986679349| ~z~0_In1986679349) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1986679349, ~z$flush_delayed~0=~z$flush_delayed~0_In1986679349, ~z~0=~z~0_In1986679349} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1986679349, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1986679349|, ~z$flush_delayed~0=~z$flush_delayed~0_In1986679349, ~z~0=~z~0_In1986679349} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 15:00:53,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 15:00:53,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_14 1) (= (+ v_~__unbuffered_cnt~0_97 1) v_~__unbuffered_cnt~0_96) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~y~0_42 v_~__unbuffered_p1_EAX~0_17)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y~0=v_~y~0_42} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_42, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 15:00:53,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In958371948 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In958371948 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out958371948| 0)) (and (= ~z$w_buff0_used~0_In958371948 |P3Thread1of1ForFork2_#t~ite51_Out958371948|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out958371948|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 15:00:53,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2017398457 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2017398457 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-2017398457 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-2017398457 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out-2017398457| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite52_Out-2017398457| ~z$w_buff1_used~0_In-2017398457) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2017398457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2017398457, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-2017398457|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2017398457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2017398457, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 15:00:53,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L833-->L834: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-265702619 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-265702619 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out-265702619 ~z$r_buff0_thd4~0_In-265702619))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-265702619) (not .cse2)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-265702619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-265702619} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-265702619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-265702619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-265702619} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:00:53,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2077024498 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-2077024498 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-2077024498 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2077024498 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-2077024498| 0)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In-2077024498 |P3Thread1of1ForFork2_#t~ite54_Out-2077024498|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2077024498} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2077024498|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2077024498} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 15:00:53,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L834-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 15:00:53,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-998949040 256)))) (or (and (= ~z$mem_tmp~0_In-998949040 |P2Thread1of1ForFork1_#t~ite25_Out-998949040|) (not .cse0)) (and (= ~z~0_In-998949040 |P2Thread1of1ForFork1_#t~ite25_Out-998949040|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-998949040, ~z$flush_delayed~0=~z$flush_delayed~0_In-998949040, ~z~0=~z~0_In-998949040} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-998949040, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-998949040|, ~z$flush_delayed~0=~z$flush_delayed~0_In-998949040, ~z~0=~z~0_In-998949040} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 15:00:53,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L785-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_184 |v_P2Thread1of1ForFork1_#t~ite25_48|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 v_~z$flush_delayed~0_206)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_47|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_206, ~z~0=v_~z~0_184, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:00:53,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L859-1-->L865: Formula: (and (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_38) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:00:53,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L865-2-->L865-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1842180640 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1842180640 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1842180640 |ULTIMATE.start_main_#t~ite59_Out1842180640|)) (and (= |ULTIMATE.start_main_#t~ite59_Out1842180640| ~z~0_In1842180640) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1842180640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1842180640, ~z$w_buff1~0=~z$w_buff1~0_In1842180640, ~z~0=~z~0_In1842180640} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1842180640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1842180640, ~z$w_buff1~0=~z$w_buff1~0_In1842180640, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1842180640|, ~z~0=~z~0_In1842180640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:00:53,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L865-4-->L866: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 15:00:53,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In574431356 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In574431356 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out574431356| ~z$w_buff0_used~0_In574431356)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out574431356|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out574431356|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:00:53,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2020964158 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2020964158 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2020964158 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2020964158 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out2020964158| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out2020964158| ~z$w_buff1_used~0_In2020964158) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020964158, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020964158, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2020964158|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020964158, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020964158, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:00:53,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L868-->L868-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In380650526 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In380650526 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In380650526 |ULTIMATE.start_main_#t~ite63_Out380650526|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out380650526|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380650526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380650526} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out380650526|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380650526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380650526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 15:00:53,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L869-->L869-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-569572461 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-569572461 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-569572461 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-569572461 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-569572461| ~z$r_buff1_thd0~0_In-569572461) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out-569572461|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-569572461, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-569572461, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-569572461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569572461} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-569572461, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-569572461, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-569572461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569572461, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-569572461|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 15:00:53,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L869-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_26) (= 0 v_~__unbuffered_p1_EAX~0_23) (= 0 v_~__unbuffered_p2_EAX~0_42) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_222 |v_ULTIMATE.start_main_#t~ite64_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_42|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:00:54,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:00:54 BasicIcfg [2019-12-07 15:00:54,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:00:54,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:00:54,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:00:54,046 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:00:54,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:59:03" (3/4) ... [2019-12-07 15:00:54,048 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:00:54,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] ULTIMATE.startENTRY-->L853: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= 0 |v_ULTIMATE.start_main_~#t461~0.offset_24|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd2~0_119 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd0~0_271 0) (= v_~z$r_buff0_thd1~0_119 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t461~0.base_34|) (= 0 v_~z$r_buff1_thd4~0_357) (= 0 v_~__unbuffered_p3_EBX~0_62) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~__unbuffered_p2_EAX~0_102) (= v_~z$w_buff1~0_242 0) (= v_~y~0_54 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t461~0.base_34| 4)) (= v_~main$tmp_guard1~0_57 0) (= 0 v_~z$flush_delayed~0_271) (= v_~main$tmp_guard0~0_23 0) (= v_~z$r_buff1_thd2~0_188 0) (= 0 v_~weak$$choice0~0_222) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff0_thd4~0_543) (= 0 v_~z$r_buff1_thd3~0_439) (= v_~weak$$choice2~0_319 0) (= v_~z$r_buff0_thd0~0_186 0) (= v_~z$w_buff0~0_347 0) (= v_~z$w_buff0_used~0_883 0) (= v_~z$read_delayed~0_7 0) (= v_~a~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t461~0.base_34|)) (= 0 v_~z$r_buff0_thd3~0_421) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_p3_EAX~0_85) (= v_~z$w_buff1_used~0_620 0) (= v_~z$r_buff1_thd1~0_188 0) (= v_~z~0_347 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t461~0.base_34| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t461~0.base_34|) |v_ULTIMATE.start_main_~#t461~0.offset_24| 0))) (= 0 v_~z$mem_tmp~0_234) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t461~0.base_34| 1)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ULTIMATE.start_main_~#t463~0.base=|v_ULTIMATE.start_main_~#t463~0.base_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_186, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_543, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_85, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~z$mem_tmp~0=v_~z$mem_tmp~0_234, ULTIMATE.start_main_~#t462~0.base=|v_ULTIMATE.start_main_~#t462~0.base_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ~z$flush_delayed~0=v_~z$flush_delayed~0_271, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_30|, ~weak$$choice0~0=v_~weak$$choice0~0_222, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_190|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_188, ~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_421, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t461~0.offset=|v_ULTIMATE.start_main_~#t461~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_357, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_22|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_242, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_57, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_271, ULTIMATE.start_main_~#t464~0.base=|v_ULTIMATE.start_main_~#t464~0.base_20|, ULTIMATE.start_main_~#t464~0.offset=|v_ULTIMATE.start_main_~#t464~0.offset_16|, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, ULTIMATE.start_main_~#t461~0.base=|v_ULTIMATE.start_main_~#t461~0.base_34|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_883, ~z$w_buff0~0=v_~z$w_buff0~0_347, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_439, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_78|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_62, ULTIMATE.start_main_~#t463~0.offset=|v_ULTIMATE.start_main_~#t463~0.offset_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_347, ~weak$$choice2~0=v_~weak$$choice2~0_319, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_119, ULTIMATE.start_main_~#t462~0.offset=|v_ULTIMATE.start_main_~#t462~0.offset_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t463~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t462~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t461~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t464~0.base, ULTIMATE.start_main_~#t464~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t461~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t463~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t462~0.offset] because there is no mapped edge [2019-12-07 15:00:54,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L853-1-->L855: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t462~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t462~0.base_13|) |v_ULTIMATE.start_main_~#t462~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t462~0.base_13| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t462~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t462~0.base_13|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t462~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t462~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t462~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, ULTIMATE.start_main_~#t462~0.base=|v_ULTIMATE.start_main_~#t462~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t462~0.offset=|v_ULTIMATE.start_main_~#t462~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t462~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t462~0.offset] because there is no mapped edge [2019-12-07 15:00:54,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L855-1-->L857: Formula: (and (= |v_ULTIMATE.start_main_~#t463~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t463~0.base_12|)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t463~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t463~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t463~0.base_12|) |v_ULTIMATE.start_main_~#t463~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t463~0.base_12| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t463~0.base_12|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t463~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_50|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_~#t463~0.offset=|v_ULTIMATE.start_main_~#t463~0.offset_11|, ULTIMATE.start_main_~#t463~0.base=|v_ULTIMATE.start_main_~#t463~0.base_12|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t463~0.offset, ULTIMATE.start_main_~#t463~0.base] because there is no mapped edge [2019-12-07 15:00:54,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L857-1-->L859: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t464~0.base_10| 4)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t464~0.base_10| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t464~0.base_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t464~0.base_10|)) (= 0 |v_ULTIMATE.start_main_~#t464~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t464~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t464~0.base_10|) |v_ULTIMATE.start_main_~#t464~0.offset_9| 3)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t464~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t464~0.base=|v_ULTIMATE.start_main_~#t464~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t464~0.offset=|v_ULTIMATE.start_main_~#t464~0.offset_9|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t464~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t464~0.offset, #length] because there is no mapped edge [2019-12-07 15:00:54,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_21) (= v_P3Thread1of1ForFork2_~arg.base_6 |v_P3Thread1of1ForFork2_#in~arg.base_8|) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_54 256) 0)) (not (= 0 (mod v_~z$w_buff0_used~0_94 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_94 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_8| v_P3Thread1of1ForFork2_~arg.offset_6) (= 1 v_~z$w_buff0~0_26) (= v_~z$w_buff0_used~0_95 v_~z$w_buff1_used~0_54)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_27, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_54, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, ~z$w_buff1~0=v_~z$w_buff1~0_21, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_6, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 15:00:54,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L815-2-->L815-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-957578960| |P3Thread1of1ForFork2_#t~ite28_Out-957578960|)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-957578960 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-957578960 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff0~0_In-957578960 |P3Thread1of1ForFork2_#t~ite28_Out-957578960|)) (and (= ~z$w_buff1~0_In-957578960 |P3Thread1of1ForFork2_#t~ite28_Out-957578960|) .cse2 (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-957578960, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-957578960, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-957578960, ~z$w_buff1~0=~z$w_buff1~0_In-957578960} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-957578960|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-957578960|, ~z$w_buff0~0=~z$w_buff0~0_In-957578960, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-957578960, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-957578960, ~z$w_buff1~0=~z$w_buff1~0_In-957578960} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 15:00:54,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (and (= v_~z$r_buff0_thd4~0_179 v_~z$r_buff0_thd4~0_180) (not (= (mod v_~weak$$choice2~0_104 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_104} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_179, ~weak$$choice2~0=v_~weak$$choice2~0_104} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:00:54,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1986679349 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1986679349| ~z$mem_tmp~0_In1986679349)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1986679349| ~z~0_In1986679349) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1986679349, ~z$flush_delayed~0=~z$flush_delayed~0_In1986679349, ~z~0=~z~0_In1986679349} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1986679349, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1986679349|, ~z$flush_delayed~0=~z$flush_delayed~0_In1986679349, ~z~0=~z~0_In1986679349} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 15:00:54,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 15:00:54,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_14 1) (= (+ v_~__unbuffered_cnt~0_97 1) v_~__unbuffered_cnt~0_96) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~y~0_42 v_~__unbuffered_p1_EAX~0_17)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y~0=v_~y~0_42} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_42, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 15:00:54,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In958371948 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In958371948 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out958371948| 0)) (and (= ~z$w_buff0_used~0_In958371948 |P3Thread1of1ForFork2_#t~ite51_Out958371948|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out958371948|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 15:00:54,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2017398457 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2017398457 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-2017398457 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-2017398457 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out-2017398457| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite52_Out-2017398457| ~z$w_buff1_used~0_In-2017398457) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2017398457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2017398457, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-2017398457|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2017398457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2017398457, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 15:00:54,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L833-->L834: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-265702619 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-265702619 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out-265702619 ~z$r_buff0_thd4~0_In-265702619))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-265702619) (not .cse2)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-265702619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-265702619} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-265702619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-265702619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-265702619} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:00:54,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2077024498 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-2077024498 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-2077024498 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2077024498 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-2077024498| 0)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In-2077024498 |P3Thread1of1ForFork2_#t~ite54_Out-2077024498|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2077024498} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2077024498|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2077024498} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 15:00:54,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L834-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 15:00:54,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-998949040 256)))) (or (and (= ~z$mem_tmp~0_In-998949040 |P2Thread1of1ForFork1_#t~ite25_Out-998949040|) (not .cse0)) (and (= ~z~0_In-998949040 |P2Thread1of1ForFork1_#t~ite25_Out-998949040|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-998949040, ~z$flush_delayed~0=~z$flush_delayed~0_In-998949040, ~z~0=~z~0_In-998949040} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-998949040, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-998949040|, ~z$flush_delayed~0=~z$flush_delayed~0_In-998949040, ~z~0=~z~0_In-998949040} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 15:00:54,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L785-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_184 |v_P2Thread1of1ForFork1_#t~ite25_48|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 v_~z$flush_delayed~0_206)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_47|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_206, ~z~0=v_~z~0_184, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:00:54,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L859-1-->L865: Formula: (and (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_38) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:00:54,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L865-2-->L865-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1842180640 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1842180640 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1842180640 |ULTIMATE.start_main_#t~ite59_Out1842180640|)) (and (= |ULTIMATE.start_main_#t~ite59_Out1842180640| ~z~0_In1842180640) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1842180640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1842180640, ~z$w_buff1~0=~z$w_buff1~0_In1842180640, ~z~0=~z~0_In1842180640} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1842180640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1842180640, ~z$w_buff1~0=~z$w_buff1~0_In1842180640, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1842180640|, ~z~0=~z~0_In1842180640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:00:54,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L865-4-->L866: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 15:00:54,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In574431356 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In574431356 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out574431356| ~z$w_buff0_used~0_In574431356)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out574431356|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out574431356|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:00:54,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2020964158 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2020964158 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2020964158 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2020964158 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out2020964158| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out2020964158| ~z$w_buff1_used~0_In2020964158) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020964158, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020964158, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2020964158|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020964158, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020964158, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:00:54,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L868-->L868-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In380650526 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In380650526 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In380650526 |ULTIMATE.start_main_#t~ite63_Out380650526|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out380650526|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380650526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380650526} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out380650526|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In380650526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In380650526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 15:00:54,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L869-->L869-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-569572461 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-569572461 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-569572461 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-569572461 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-569572461| ~z$r_buff1_thd0~0_In-569572461) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out-569572461|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-569572461, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-569572461, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-569572461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569572461} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-569572461, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-569572461, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-569572461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569572461, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-569572461|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 15:00:54,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L869-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_26) (= 0 v_~__unbuffered_p1_EAX~0_23) (= 0 v_~__unbuffered_p2_EAX~0_42) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_222 |v_ULTIMATE.start_main_#t~ite64_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_42|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:00:54,128 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ee054b5e-d8f5-4cfc-9924-2fc5d8da44f8/bin/uautomizer/witness.graphml [2019-12-07 15:00:54,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:00:54,129 INFO L168 Benchmark]: Toolchain (without parser) took 112010.02 ms. Allocated memory was 1.0 GB in the beginning and 8.5 GB in the end (delta: 7.5 GB). Free memory was 934.3 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 15:00:54,129 INFO L168 Benchmark]: CDTParser took 0.16 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 15:00:54,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:54,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:00:54,130 INFO L168 Benchmark]: Boogie Preprocessor took 28.18 ms. Allocated memory is still 1.2 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 15:00:54,130 INFO L168 Benchmark]: RCFGBuilder took 442.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:54,130 INFO L168 Benchmark]: TraceAbstraction took 110936.52 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 15:00:54,131 INFO L168 Benchmark]: Witness Printer took 82.36 ms. Allocated memory is still 8.5 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:54,132 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.16 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 473.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.18 ms. Allocated memory is still 1.2 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. * RCFGBuilder took 442.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110936.52 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 82.36 ms. Allocated memory is still 8.5 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 212 ProgramPointsBefore, 113 ProgramPointsAfterwards, 255 TransitionsBefore, 133 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 11467 VarBasedMoverChecksPositive, 326 VarBasedMoverChecksNegative, 90 SemBasedMoverChecksPositive, 332 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 128453 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L853] FCALL, FORK 0 pthread_create(&t461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] FCALL, FORK 0 pthread_create(&t462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L857] FCALL, FORK 0 pthread_create(&t463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L859] FCALL, FORK 0 pthread_create(&t464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L815] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 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, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 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) [L778] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L778] 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)) [L779] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 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)) [L780] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=1, x=1, y=1, z=0, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L780] 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)) [L781] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L781] 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)) [L782] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L783] 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)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L865] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 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 [L868] 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 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 110.7s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5136 SDtfs, 7451 SDslu, 10986 SDs, 0 SdLazy, 4218 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216438occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 68.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 256572 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 932 NumberOfCodeBlocks, 932 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 298936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...