./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_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_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/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 b97d688e2da96644d360b29e18aba2cfb2579801 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:50:32,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:50:32,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:50:32,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:50:32,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:50:32,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:50:32,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:50:32,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:50:32,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:50:32,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:50:32,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:50:32,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:50:32,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:50:32,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:50:32,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:50:32,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:50:32,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:50:32,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:50:32,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:50:32,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:50:32,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:50:32,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:50:32,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:50:32,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:50:32,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:50:32,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:50:32,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:50:32,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:50:32,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:50:32,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:50:32,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:50:32,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:50:32,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:50:32,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:50:32,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:50:32,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:50:32,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:50:32,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:50:32,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:50:32,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:50:32,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:50:32,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:50:32,767 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:50:32,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:50:32,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:50:32,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:50:32,768 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:50:32,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:50:32,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:50:32,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:50:32,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:50:32,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:50:32,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:50:32,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:50:32,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:50:32,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:50:32,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:50:32,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:50:32,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:50:32,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:50:32,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:50:32,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:50:32,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:50:32,771 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:50:32,771 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_24a978d5-db97-4d9d-92a4-a42de93ba5a3/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 -> b97d688e2da96644d360b29e18aba2cfb2579801 [2019-12-07 17:50:32,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:50:32,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:50:32,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:50:32,883 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:50:32,883 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:50:32,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2019-12-07 17:50:32,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/data/0df690da2/90c7d5187970497ab02554537c83fef7/FLAGc38e7da71 [2019-12-07 17:50:33,385 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:50:33,385 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2019-12-07 17:50:33,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/data/0df690da2/90c7d5187970497ab02554537c83fef7/FLAGc38e7da71 [2019-12-07 17:50:33,404 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/data/0df690da2/90c7d5187970497ab02554537c83fef7 [2019-12-07 17:50:33,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:50:33,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:50:33,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:50:33,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:50:33,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:50:33,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33, skipping insertion in model container [2019-12-07 17:50:33,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:50:33,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:50:33,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:50:33,756 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:50:33,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:50:33,840 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:50:33,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33 WrapperNode [2019-12-07 17:50:33,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:50:33,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:50:33,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:50:33,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:50:33,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:50:33,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:50:33,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:50:33,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:50:33,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... [2019-12-07 17:50:33,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:50:33,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:50:33,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:50:33,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:50:33,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/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 17:50:33,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:50:33,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:50:33,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:50:33,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:50:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:50:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:50:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:50:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:50:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:50:33,951 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 17:50:34,289 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:50:34,290 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:50:34,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:50:34 BoogieIcfgContainer [2019-12-07 17:50:34,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:50:34,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:50:34,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:50:34,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:50:34,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:50:33" (1/3) ... [2019-12-07 17:50:34,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc4feb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:50:34, skipping insertion in model container [2019-12-07 17:50:34,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:33" (2/3) ... [2019-12-07 17:50:34,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc4feb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:50:34, skipping insertion in model container [2019-12-07 17:50:34,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:50:34" (3/3) ... [2019-12-07 17:50:34,295 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2019-12-07 17:50:34,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:50:34,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:50:34,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:50:34,307 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:50:34,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:34,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:50:34,364 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:50:34,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:50:34,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:50:34,364 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:50:34,364 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:50:34,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:50:34,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:50:34,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:50:34,375 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-07 17:50:34,376 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 17:50:34,428 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 17:50:34,429 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:50:34,437 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 480 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 17:50:34,449 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 17:50:34,475 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 17:50:34,475 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:50:34,479 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 480 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 17:50:34,490 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-07 17:50:34,491 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:50:37,400 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 17:50:37,521 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-07 17:50:37,521 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-07 17:50:37,524 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-07 17:50:39,385 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-07 17:50:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-07 17:50:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:50:39,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:39,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:50:39,392 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-07 17:50:39,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:39,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762474399] [2019-12-07 17:50:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:39,553 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 17:50:39,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762474399] [2019-12-07 17:50:39,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:39,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:50:39,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965815316] [2019-12-07 17:50:39,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:39,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:39,568 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-07 17:50:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:39,900 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-07 17:50:39,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:39,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:50:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:40,116 INFO L225 Difference]: With dead ends: 34366 [2019-12-07 17:50:40,116 INFO L226 Difference]: Without dead ends: 33638 [2019-12-07 17:50:40,117 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 17:50:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-07 17:50:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-07 17:50:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-07 17:50:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-07 17:50:41,126 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-07 17:50:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:41,127 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-07 17:50:41,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-07 17:50:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:50:41,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:41,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:50:41,133 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-07 17:50:41,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:41,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546414541] [2019-12-07 17:50:41,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:41,194 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 17:50:41,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546414541] [2019-12-07 17:50:41,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:41,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:41,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498297973] [2019-12-07 17:50:41,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:50:41,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:50:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:41,197 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-07 17:50:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:41,692 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-07 17:50:41,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:41,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:50:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:41,980 INFO L225 Difference]: With dead ends: 52350 [2019-12-07 17:50:41,980 INFO L226 Difference]: Without dead ends: 52322 [2019-12-07 17:50:41,980 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 17:50:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-07 17:50:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-07 17:50:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-07 17:50:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-07 17:50:43,154 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-07 17:50:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:43,154 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-07 17:50:43,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:50:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-07 17:50:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:50:43,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:43,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:50:43,157 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-07 17:50:43,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:43,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535690703] [2019-12-07 17:50:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:43,208 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 17:50:43,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535690703] [2019-12-07 17:50:43,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:43,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:43,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904640813] [2019-12-07 17:50:43,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:50:43,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:43,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:50:43,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:43,210 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 4 states. [2019-12-07 17:50:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:43,643 INFO L93 Difference]: Finished difference Result 59254 states and 242916 transitions. [2019-12-07 17:50:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:43,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:50:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:43,777 INFO L225 Difference]: With dead ends: 59254 [2019-12-07 17:50:43,777 INFO L226 Difference]: Without dead ends: 59254 [2019-12-07 17:50:43,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 17:50:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59254 states. [2019-12-07 17:50:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59254 to 52846. [2019-12-07 17:50:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52846 states. [2019-12-07 17:50:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52846 states to 52846 states and 218200 transitions. [2019-12-07 17:50:45,063 INFO L78 Accepts]: Start accepts. Automaton has 52846 states and 218200 transitions. Word has length 15 [2019-12-07 17:50:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:45,064 INFO L462 AbstractCegarLoop]: Abstraction has 52846 states and 218200 transitions. [2019-12-07 17:50:45,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:50:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52846 states and 218200 transitions. [2019-12-07 17:50:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:50:45,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:45,078 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 17:50:45,078 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash 254508137, now seen corresponding path program 1 times [2019-12-07 17:50:45,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:45,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245780553] [2019-12-07 17:50:45,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:45,158 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 17:50:45,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245780553] [2019-12-07 17:50:45,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:45,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:50:45,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762658172] [2019-12-07 17:50:45,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:50:45,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:45,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:50:45,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:50:45,159 INFO L87 Difference]: Start difference. First operand 52846 states and 218200 transitions. Second operand 5 states. [2019-12-07 17:50:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:45,809 INFO L93 Difference]: Finished difference Result 70826 states and 287832 transitions. [2019-12-07 17:50:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:50:45,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 17:50:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:45,959 INFO L225 Difference]: With dead ends: 70826 [2019-12-07 17:50:45,959 INFO L226 Difference]: Without dead ends: 70798 [2019-12-07 17:50:45,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 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 17:50:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70798 states. [2019-12-07 17:50:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70798 to 52914. [2019-12-07 17:50:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52914 states. [2019-12-07 17:50:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52914 states to 52914 states and 218104 transitions. [2019-12-07 17:50:48,379 INFO L78 Accepts]: Start accepts. Automaton has 52914 states and 218104 transitions. Word has length 21 [2019-12-07 17:50:48,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:48,379 INFO L462 AbstractCegarLoop]: Abstraction has 52914 states and 218104 transitions. [2019-12-07 17:50:48,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:50:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 52914 states and 218104 transitions. [2019-12-07 17:50:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:50:48,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:48,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:50:48,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1007840852, now seen corresponding path program 1 times [2019-12-07 17:50:48,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:48,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128194204] [2019-12-07 17:50:48,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:48,448 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 17:50:48,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128194204] [2019-12-07 17:50:48,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:48,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:48,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127811125] [2019-12-07 17:50:48,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:48,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:48,449 INFO L87 Difference]: Start difference. First operand 52914 states and 218104 transitions. Second operand 3 states. [2019-12-07 17:50:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:48,583 INFO L93 Difference]: Finished difference Result 41543 states and 158120 transitions. [2019-12-07 17:50:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:48,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 17:50:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:48,661 INFO L225 Difference]: With dead ends: 41543 [2019-12-07 17:50:48,662 INFO L226 Difference]: Without dead ends: 41543 [2019-12-07 17:50:48,662 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 17:50:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41543 states. [2019-12-07 17:50:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41543 to 41543. [2019-12-07 17:50:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41543 states. [2019-12-07 17:50:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41543 states to 41543 states and 158120 transitions. [2019-12-07 17:50:49,433 INFO L78 Accepts]: Start accepts. Automaton has 41543 states and 158120 transitions. Word has length 29 [2019-12-07 17:50:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:49,433 INFO L462 AbstractCegarLoop]: Abstraction has 41543 states and 158120 transitions. [2019-12-07 17:50:49,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 41543 states and 158120 transitions. [2019-12-07 17:50:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:50:49,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:49,456 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] [2019-12-07 17:50:49,457 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1153771889, now seen corresponding path program 1 times [2019-12-07 17:50:49,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:49,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361069345] [2019-12-07 17:50:49,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:49,501 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 17:50:49,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361069345] [2019-12-07 17:50:49,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:49,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:50:49,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479470905] [2019-12-07 17:50:49,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:50:49,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:50:49,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:49,503 INFO L87 Difference]: Start difference. First operand 41543 states and 158120 transitions. Second operand 4 states. [2019-12-07 17:50:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:49,552 INFO L93 Difference]: Finished difference Result 17329 states and 54594 transitions. [2019-12-07 17:50:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:50:49,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 17:50:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:49,573 INFO L225 Difference]: With dead ends: 17329 [2019-12-07 17:50:49,573 INFO L226 Difference]: Without dead ends: 17329 [2019-12-07 17:50:49,574 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 17:50:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17329 states. [2019-12-07 17:50:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17329 to 17329. [2019-12-07 17:50:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17329 states. [2019-12-07 17:50:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17329 states to 17329 states and 54594 transitions. [2019-12-07 17:50:49,926 INFO L78 Accepts]: Start accepts. Automaton has 17329 states and 54594 transitions. Word has length 30 [2019-12-07 17:50:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:49,926 INFO L462 AbstractCegarLoop]: Abstraction has 17329 states and 54594 transitions. [2019-12-07 17:50:49,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:50:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17329 states and 54594 transitions. [2019-12-07 17:50:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:50:49,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:49,934 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] [2019-12-07 17:50:49,934 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2070972968, now seen corresponding path program 1 times [2019-12-07 17:50:49,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:49,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782747181] [2019-12-07 17:50:49,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:49,969 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 17:50:49,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782747181] [2019-12-07 17:50:49,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:49,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:50:49,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005478619] [2019-12-07 17:50:49,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:50:49,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:50:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:50:49,971 INFO L87 Difference]: Start difference. First operand 17329 states and 54594 transitions. Second operand 5 states. [2019-12-07 17:50:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:49,993 INFO L93 Difference]: Finished difference Result 2957 states and 7512 transitions. [2019-12-07 17:50:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:49,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 17:50:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:49,996 INFO L225 Difference]: With dead ends: 2957 [2019-12-07 17:50:49,996 INFO L226 Difference]: Without dead ends: 2957 [2019-12-07 17:50:49,997 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 17:50:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2019-12-07 17:50:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2019-12-07 17:50:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2957 states. [2019-12-07 17:50:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 7512 transitions. [2019-12-07 17:50:50,026 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 7512 transitions. Word has length 31 [2019-12-07 17:50:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:50,026 INFO L462 AbstractCegarLoop]: Abstraction has 2957 states and 7512 transitions. [2019-12-07 17:50:50,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:50:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 7512 transitions. [2019-12-07 17:50:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:50:50,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:50,030 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] [2019-12-07 17:50:50,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1919926116, now seen corresponding path program 1 times [2019-12-07 17:50:50,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:50,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859174675] [2019-12-07 17:50:50,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:50,078 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 17:50:50,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859174675] [2019-12-07 17:50:50,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:50,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:50:50,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256631206] [2019-12-07 17:50:50,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:50:50,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:50:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:50:50,079 INFO L87 Difference]: Start difference. First operand 2957 states and 7512 transitions. Second operand 6 states. [2019-12-07 17:50:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:50,103 INFO L93 Difference]: Finished difference Result 1371 states and 3902 transitions. [2019-12-07 17:50:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:50:50,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 17:50:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:50,106 INFO L225 Difference]: With dead ends: 1371 [2019-12-07 17:50:50,106 INFO L226 Difference]: Without dead ends: 1371 [2019-12-07 17:50:50,106 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 17:50:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-07 17:50:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1231. [2019-12-07 17:50:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-07 17:50:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 3502 transitions. [2019-12-07 17:50:50,118 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 3502 transitions. Word has length 43 [2019-12-07 17:50:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:50,118 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 3502 transitions. [2019-12-07 17:50:50,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:50:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 3502 transitions. [2019-12-07 17:50:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:50:50,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:50,120 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] [2019-12-07 17:50:50,120 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-07 17:50:50,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:50,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441839322] [2019-12-07 17:50:50,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:50:50,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441839322] [2019-12-07 17:50:50,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:50,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:50:50,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143959849] [2019-12-07 17:50:50,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:50,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:50,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:50,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:50,167 INFO L87 Difference]: Start difference. First operand 1231 states and 3502 transitions. Second operand 3 states. [2019-12-07 17:50:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:50,190 INFO L93 Difference]: Finished difference Result 1239 states and 3510 transitions. [2019-12-07 17:50:50,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:50,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 17:50:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:50,192 INFO L225 Difference]: With dead ends: 1239 [2019-12-07 17:50:50,192 INFO L226 Difference]: Without dead ends: 1239 [2019-12-07 17:50:50,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-07 17:50:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1234. [2019-12-07 17:50:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234 states. [2019-12-07 17:50:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 3505 transitions. [2019-12-07 17:50:50,205 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 3505 transitions. Word has length 58 [2019-12-07 17:50:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:50,205 INFO L462 AbstractCegarLoop]: Abstraction has 1234 states and 3505 transitions. [2019-12-07 17:50:50,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 3505 transitions. [2019-12-07 17:50:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:50:50,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:50,207 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] [2019-12-07 17:50:50,207 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-07 17:50:50,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:50,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381884125] [2019-12-07 17:50:50,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:50,267 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 17:50:50,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381884125] [2019-12-07 17:50:50,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:50,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:50:50,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734067841] [2019-12-07 17:50:50,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:50:50,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:50:50,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:50:50,268 INFO L87 Difference]: Start difference. First operand 1234 states and 3505 transitions. Second operand 5 states. [2019-12-07 17:50:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:50,398 INFO L93 Difference]: Finished difference Result 1775 states and 5027 transitions. [2019-12-07 17:50:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:50:50,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 17:50:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:50,400 INFO L225 Difference]: With dead ends: 1775 [2019-12-07 17:50:50,400 INFO L226 Difference]: Without dead ends: 1775 [2019-12-07 17:50:50,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:50:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-07 17:50:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1599. [2019-12-07 17:50:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-12-07 17:50:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 4535 transitions. [2019-12-07 17:50:50,415 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 4535 transitions. Word has length 58 [2019-12-07 17:50:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:50,416 INFO L462 AbstractCegarLoop]: Abstraction has 1599 states and 4535 transitions. [2019-12-07 17:50:50,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:50:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 4535 transitions. [2019-12-07 17:50:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:50:50,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:50,418 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] [2019-12-07 17:50:50,418 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-07 17:50:50,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:50,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615662113] [2019-12-07 17:50:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:50,490 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 17:50:50,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615662113] [2019-12-07 17:50:50,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:50,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:50:50,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553169857] [2019-12-07 17:50:50,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:50:50,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:50,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:50:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:50:50,492 INFO L87 Difference]: Start difference. First operand 1599 states and 4535 transitions. Second operand 6 states. [2019-12-07 17:50:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:50,705 INFO L93 Difference]: Finished difference Result 2377 states and 6739 transitions. [2019-12-07 17:50:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:50:50,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 17:50:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:50,707 INFO L225 Difference]: With dead ends: 2377 [2019-12-07 17:50:50,707 INFO L226 Difference]: Without dead ends: 2377 [2019-12-07 17:50:50,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:50:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-07 17:50:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1743. [2019-12-07 17:50:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2019-12-07 17:50:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 4963 transitions. [2019-12-07 17:50:50,728 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 4963 transitions. Word has length 58 [2019-12-07 17:50:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:50,728 INFO L462 AbstractCegarLoop]: Abstraction has 1743 states and 4963 transitions. [2019-12-07 17:50:50,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:50:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 4963 transitions. [2019-12-07 17:50:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:50:50,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:50,731 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] [2019-12-07 17:50:50,731 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-07 17:50:50,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:50,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241801040] [2019-12-07 17:50:50,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:50,792 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 17:50:50,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241801040] [2019-12-07 17:50:50,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:50,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:50:50,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939058416] [2019-12-07 17:50:50,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:50:50,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:50:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:50:50,793 INFO L87 Difference]: Start difference. First operand 1743 states and 4963 transitions. Second operand 6 states. [2019-12-07 17:50:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:50,980 INFO L93 Difference]: Finished difference Result 2557 states and 7219 transitions. [2019-12-07 17:50:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:50:50,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 17:50:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:50,983 INFO L225 Difference]: With dead ends: 2557 [2019-12-07 17:50:50,983 INFO L226 Difference]: Without dead ends: 2557 [2019-12-07 17:50:50,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:50:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-12-07 17:50:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 1903. [2019-12-07 17:50:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-07 17:50:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 5419 transitions. [2019-12-07 17:50:51,003 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 5419 transitions. Word has length 58 [2019-12-07 17:50:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,004 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 5419 transitions. [2019-12-07 17:50:51,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:50:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 5419 transitions. [2019-12-07 17:50:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:50:51,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,006 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] [2019-12-07 17:50:51,006 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-07 17:50:51,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401661402] [2019-12-07 17:50:51,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:51,086 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 17:50:51,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401661402] [2019-12-07 17:50:51,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:51,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:50:51,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096107943] [2019-12-07 17:50:51,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:50:51,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:50:51,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:50:51,087 INFO L87 Difference]: Start difference. First operand 1903 states and 5419 transitions. Second operand 8 states. [2019-12-07 17:50:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:51,323 INFO L93 Difference]: Finished difference Result 2834 states and 8013 transitions. [2019-12-07 17:50:51,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:50:51,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-07 17:50:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,326 INFO L225 Difference]: With dead ends: 2834 [2019-12-07 17:50:51,326 INFO L226 Difference]: Without dead ends: 2834 [2019-12-07 17:50:51,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:50:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2019-12-07 17:50:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 1847. [2019-12-07 17:50:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-12-07 17:50:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 5259 transitions. [2019-12-07 17:50:51,350 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 5259 transitions. Word has length 58 [2019-12-07 17:50:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,350 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 5259 transitions. [2019-12-07 17:50:51,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:50:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 5259 transitions. [2019-12-07 17:50:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:50:51,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,352 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] [2019-12-07 17:50:51,352 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash -240075320, now seen corresponding path program 1 times [2019-12-07 17:50:51,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69220780] [2019-12-07 17:50:51,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:51,395 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 17:50:51,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69220780] [2019-12-07 17:50:51,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:51,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:51,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530668896] [2019-12-07 17:50:51,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:51,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:51,396 INFO L87 Difference]: Start difference. First operand 1847 states and 5259 transitions. Second operand 3 states. [2019-12-07 17:50:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:51,425 INFO L93 Difference]: Finished difference Result 1847 states and 5258 transitions. [2019-12-07 17:50:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:51,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 17:50:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,427 INFO L225 Difference]: With dead ends: 1847 [2019-12-07 17:50:51,428 INFO L226 Difference]: Without dead ends: 1847 [2019-12-07 17:50:51,428 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 17:50:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-12-07 17:50:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1314. [2019-12-07 17:50:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-12-07 17:50:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 3752 transitions. [2019-12-07 17:50:51,442 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 3752 transitions. Word has length 59 [2019-12-07 17:50:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,442 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 3752 transitions. [2019-12-07 17:50:51,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 3752 transitions. [2019-12-07 17:50:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:50:51,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,444 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] [2019-12-07 17:50:51,444 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash -248733535, now seen corresponding path program 1 times [2019-12-07 17:50:51,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941438641] [2019-12-07 17:50:51,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:51,526 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 17:50:51,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941438641] [2019-12-07 17:50:51,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:51,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:50:51,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567558259] [2019-12-07 17:50:51,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:50:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:50:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:50:51,528 INFO L87 Difference]: Start difference. First operand 1314 states and 3752 transitions. Second operand 6 states. [2019-12-07 17:50:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:51,570 INFO L93 Difference]: Finished difference Result 1867 states and 5034 transitions. [2019-12-07 17:50:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:50:51,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 17:50:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,572 INFO L225 Difference]: With dead ends: 1867 [2019-12-07 17:50:51,573 INFO L226 Difference]: Without dead ends: 1182 [2019-12-07 17:50:51,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:50:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-12-07 17:50:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2019-12-07 17:50:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-12-07 17:50:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 3305 transitions. [2019-12-07 17:50:51,590 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 3305 transitions. Word has length 59 [2019-12-07 17:50:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,590 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 3305 transitions. [2019-12-07 17:50:51,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:50:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 3305 transitions. [2019-12-07 17:50:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:50:51,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,592 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] [2019-12-07 17:50:51,592 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1360237091, now seen corresponding path program 2 times [2019-12-07 17:50:51,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793286020] [2019-12-07 17:50:51,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:51,649 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 17:50:51,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793286020] [2019-12-07 17:50:51,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:51,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:50:51,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814636143] [2019-12-07 17:50:51,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:50:51,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:50:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:50:51,650 INFO L87 Difference]: Start difference. First operand 1182 states and 3305 transitions. Second operand 5 states. [2019-12-07 17:50:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:51,683 INFO L93 Difference]: Finished difference Result 1488 states and 3858 transitions. [2019-12-07 17:50:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:51,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 17:50:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,684 INFO L225 Difference]: With dead ends: 1488 [2019-12-07 17:50:51,684 INFO L226 Difference]: Without dead ends: 870 [2019-12-07 17:50:51,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:50:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-12-07 17:50:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-12-07 17:50:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-12-07 17:50:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2140 transitions. [2019-12-07 17:50:51,692 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2140 transitions. Word has length 59 [2019-12-07 17:50:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,693 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 2140 transitions. [2019-12-07 17:50:51,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:50:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2140 transitions. [2019-12-07 17:50:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:50:51,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,694 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] [2019-12-07 17:50:51,694 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1505400511, now seen corresponding path program 3 times [2019-12-07 17:50:51,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898622325] [2019-12-07 17:50:51,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:51,745 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 17:50:51,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898622325] [2019-12-07 17:50:51,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:51,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:50:51,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683913978] [2019-12-07 17:50:51,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:50:51,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:50:51,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:50:51,747 INFO L87 Difference]: Start difference. First operand 870 states and 2140 transitions. Second operand 5 states. [2019-12-07 17:50:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:51,781 INFO L93 Difference]: Finished difference Result 1084 states and 2539 transitions. [2019-12-07 17:50:51,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:51,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 17:50:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,782 INFO L225 Difference]: With dead ends: 1084 [2019-12-07 17:50:51,782 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 17:50:51,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:50:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 17:50:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-12-07 17:50:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 17:50:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 527 transitions. [2019-12-07 17:50:51,784 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 527 transitions. Word has length 59 [2019-12-07 17:50:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,784 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 527 transitions. [2019-12-07 17:50:51,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:50:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 527 transitions. [2019-12-07 17:50:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:50:51,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,785 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] [2019-12-07 17:50:51,785 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -643294107, now seen corresponding path program 4 times [2019-12-07 17:50:51,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53739533] [2019-12-07 17:50:51,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:51,816 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 17:50:51,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53739533] [2019-12-07 17:50:51,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:51,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:51,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5703822] [2019-12-07 17:50:51,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:51,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:51,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:51,818 INFO L87 Difference]: Start difference. First operand 285 states and 527 transitions. Second operand 3 states. [2019-12-07 17:50:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:51,826 INFO L93 Difference]: Finished difference Result 264 states and 470 transitions. [2019-12-07 17:50:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:51,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 17:50:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,826 INFO L225 Difference]: With dead ends: 264 [2019-12-07 17:50:51,826 INFO L226 Difference]: Without dead ends: 264 [2019-12-07 17:50:51,827 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 17:50:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-07 17:50:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-12-07 17:50:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 17:50:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-07 17:50:51,830 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 59 [2019-12-07 17:50:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:51,830 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-07 17:50:51,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-07 17:50:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:50:51,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:51,831 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] [2019-12-07 17:50:51,831 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 1 times [2019-12-07 17:50:51,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:51,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519839116] [2019-12-07 17:50:51,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:52,037 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 17:50:52,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519839116] [2019-12-07 17:50:52,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:52,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:50:52,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211115615] [2019-12-07 17:50:52,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:50:52,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:50:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:50:52,039 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 13 states. [2019-12-07 17:50:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:52,360 INFO L93 Difference]: Finished difference Result 386 states and 663 transitions. [2019-12-07 17:50:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:50:52,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-07 17:50:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:52,360 INFO L225 Difference]: With dead ends: 386 [2019-12-07 17:50:52,360 INFO L226 Difference]: Without dead ends: 358 [2019-12-07 17:50:52,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:50:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-07 17:50:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2019-12-07 17:50:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-07 17:50:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-07 17:50:52,364 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-07 17:50:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:52,364 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-07 17:50:52,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:50:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-07 17:50:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:50:52,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:52,365 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] [2019-12-07 17:50:52,365 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 2 times [2019-12-07 17:50:52,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:52,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214204192] [2019-12-07 17:50:52,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:52,558 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 17:50:52,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214204192] [2019-12-07 17:50:52,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:52,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:50:52,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449638310] [2019-12-07 17:50:52,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:50:52,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:50:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:50:52,560 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 14 states. [2019-12-07 17:50:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:52,992 INFO L93 Difference]: Finished difference Result 458 states and 779 transitions. [2019-12-07 17:50:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:50:52,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-07 17:50:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:52,992 INFO L225 Difference]: With dead ends: 458 [2019-12-07 17:50:52,992 INFO L226 Difference]: Without dead ends: 430 [2019-12-07 17:50:52,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:50:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-07 17:50:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 332. [2019-12-07 17:50:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-07 17:50:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-07 17:50:52,995 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-07 17:50:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:52,995 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-07 17:50:52,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:50:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-07 17:50:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:50:52,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:52,996 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] [2019-12-07 17:50:52,996 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 3 times [2019-12-07 17:50:52,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:52,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404862875] [2019-12-07 17:50:52,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:53,336 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 17:50:53,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404862875] [2019-12-07 17:50:53,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:53,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 17:50:53,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946592237] [2019-12-07 17:50:53,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:50:53,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:50:53,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:50:53,337 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 19 states. [2019-12-07 17:50:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:54,088 INFO L93 Difference]: Finished difference Result 587 states and 1013 transitions. [2019-12-07 17:50:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:50:54,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-12-07 17:50:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:54,089 INFO L225 Difference]: With dead ends: 587 [2019-12-07 17:50:54,089 INFO L226 Difference]: Without dead ends: 559 [2019-12-07 17:50:54,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:50:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-07 17:50:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 355. [2019-12-07 17:50:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 17:50:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 627 transitions. [2019-12-07 17:50:54,092 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 627 transitions. Word has length 60 [2019-12-07 17:50:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:54,093 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 627 transitions. [2019-12-07 17:50:54,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:50:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 627 transitions. [2019-12-07 17:50:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:50:54,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:50:54,093 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash 105094848, now seen corresponding path program 4 times [2019-12-07 17:50:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:54,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902873563] [2019-12-07 17:50:54,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:54,255 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 17:50:54,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902873563] [2019-12-07 17:50:54,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:54,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:50:54,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300729395] [2019-12-07 17:50:54,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:50:54,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:50:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:50:54,257 INFO L87 Difference]: Start difference. First operand 355 states and 627 transitions. Second operand 12 states. [2019-12-07 17:50:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:54,466 INFO L93 Difference]: Finished difference Result 453 states and 774 transitions. [2019-12-07 17:50:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:50:54,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-07 17:50:54,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:54,467 INFO L225 Difference]: With dead ends: 453 [2019-12-07 17:50:54,467 INFO L226 Difference]: Without dead ends: 425 [2019-12-07 17:50:54,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:50:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-07 17:50:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 340. [2019-12-07 17:50:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 17:50:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-07 17:50:54,470 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-07 17:50:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:54,471 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-07 17:50:54,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:50:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-07 17:50:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:50:54,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:54,471 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] [2019-12-07 17:50:54,471 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 5 times [2019-12-07 17:50:54,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:54,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012581883] [2019-12-07 17:50:54,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:50:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:50:54,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:50:54,537 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:50:54,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1277~0.base_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21| 1) |v_#valid_73|) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21|) 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1277~0.base_21| 4) |v_#length_29|) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21|) |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1277~0.base=|v_ULTIMATE.start_main_~#t1277~0.base_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_23|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_~#t1277~0.offset=|v_ULTIMATE.start_main_~#t1277~0.offset_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_22|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_18|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1277~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1280~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1277~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1279~0.offset, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1278~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1279~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-07 17:50:54,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1278~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1278~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1278~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13|) |v_ULTIMATE.start_main_~#t1278~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1278~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_13|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1278~0.base, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-07 17:50:54,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11|) |v_ULTIMATE.start_main_~#t1279~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t1279~0.base_11|)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1279~0.offset_10|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1279~0.base_11|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1279~0.base_11| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1279~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1279~0.offset] because there is no mapped edge [2019-12-07 17:50:54,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1280~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13|) |v_ULTIMATE.start_main_~#t1280~0.offset_11| 3)) |v_#memory_int_17|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1280~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1280~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1280~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_11|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1280~0.base] because there is no mapped edge [2019-12-07 17:50:54,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_16 0))) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_16, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_16, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 17:50:54,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_62 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:50:54,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_12) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:50:54,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In739847724 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In739847724 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out739847724| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In739847724 |P3Thread1of1ForFork3_#t~ite11_Out739847724|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In739847724, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In739847724} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In739847724, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In739847724, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out739847724|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-07 17:50:54,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1845423105 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1845423105 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1845423105 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1845423105 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1845423105|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1845423105 |P3Thread1of1ForFork3_#t~ite12_Out-1845423105|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1845423105, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845423105, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1845423105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845423105} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1845423105, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845423105, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1845423105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845423105, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1845423105|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-07 17:50:54,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1412050353 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1412050353 256) 0))) (or (and (= ~z~0_In-1412050353 |P2Thread1of1ForFork2_#t~ite3_Out-1412050353|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1412050353 |P2Thread1of1ForFork2_#t~ite3_Out-1412050353|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1412050353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412050353, ~z$w_buff1~0=~z$w_buff1~0_In-1412050353, ~z~0=~z~0_In-1412050353} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1412050353|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1412050353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412050353, ~z$w_buff1~0=~z$w_buff1~0_In-1412050353, ~z~0=~z~0_In-1412050353} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 17:50:54,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_32 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-07 17:50:54,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1483846188 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1483846188 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1483846188|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1483846188 |P2Thread1of1ForFork2_#t~ite5_Out-1483846188|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1483846188} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1483846188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1483846188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 17:50:54,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1748848408 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1748848408 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1748848408 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1748848408 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1748848408|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1748848408| ~z$w_buff1_used~0_In-1748848408) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1748848408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1748848408, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1748848408} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1748848408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1748848408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1748848408, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1748848408} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 17:50:54,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2073946924 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In2073946924 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out2073946924| 0)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2073946924| ~z$r_buff0_thd3~0_In2073946924) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2073946924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2073946924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2073946924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2073946924, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2073946924|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 17:50:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In935403897 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In935403897 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In935403897 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In935403897 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out935403897|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In935403897 |P2Thread1of1ForFork2_#t~ite8_Out935403897|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In935403897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In935403897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In935403897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In935403897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In935403897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In935403897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In935403897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In935403897, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out935403897|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 17:50:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite8_34| v_~z$r_buff1_thd3~0_64) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_34|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_33|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 17:50:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1693755387 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1693755387 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In-1693755387 ~z$r_buff0_thd4~0_Out-1693755387))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1693755387)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1693755387} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1693755387, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1693755387|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-07 17:50:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In824674567 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In824674567 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In824674567 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In824674567 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out824674567| ~z$r_buff1_thd4~0_In824674567)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out824674567| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In824674567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In824674567, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In824674567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In824674567} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In824674567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In824674567, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out824674567|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In824674567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In824674567} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-07 17:50:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= |v_P3Thread1of1ForFork3_#t~ite14_44| v_~z$r_buff1_thd4~0_75)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_43|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:50:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_62) 1 0)) 0 1) v_~main$tmp_guard0~0_8)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-07 17:50:54,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In582267171 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In582267171 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out582267171| |ULTIMATE.start_main_#t~ite20_Out582267171|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out582267171| ~z$w_buff1~0_In582267171) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out582267171| ~z~0_In582267171) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In582267171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In582267171, ~z$w_buff1~0=~z$w_buff1~0_In582267171, ~z~0=~z~0_In582267171} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out582267171|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In582267171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In582267171, ~z$w_buff1~0=~z$w_buff1~0_In582267171, ~z~0=~z~0_In582267171, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out582267171|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 17:50:54,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1179881601 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1179881601 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1179881601| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out1179881601| ~z$w_buff0_used~0_In1179881601) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179881601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179881601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1179881601|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 17:50:54,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-225272658 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-225272658 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-225272658 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-225272658 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-225272658| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-225272658 |ULTIMATE.start_main_#t~ite22_Out-225272658|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-225272658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225272658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-225272658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225272658} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-225272658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225272658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-225272658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225272658, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-225272658|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 17:50:54,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1488748305 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1488748305 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1488748305|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1488748305 |ULTIMATE.start_main_#t~ite23_Out-1488748305|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1488748305, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488748305} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1488748305, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488748305, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1488748305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 17:50:54,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1579771423 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1579771423 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1579771423 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1579771423 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out1579771423| ~z$r_buff1_thd0~0_In1579771423)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite24_Out1579771423| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1579771423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1579771423, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1579771423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1579771423} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1579771423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1579771423, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1579771423, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1579771423|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1579771423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 17:50:54,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1749382372 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_In1749382372| |ULTIMATE.start_main_#t~ite30_Out1749382372|) (= |ULTIMATE.start_main_#t~ite31_Out1749382372| ~z$w_buff0~0_In1749382372)) (and (= |ULTIMATE.start_main_#t~ite31_Out1749382372| |ULTIMATE.start_main_#t~ite30_Out1749382372|) (= |ULTIMATE.start_main_#t~ite30_Out1749382372| ~z$w_buff0~0_In1749382372) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1749382372 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1749382372 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1749382372 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In1749382372 256)) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749382372, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In1749382372|, ~z$w_buff0~0=~z$w_buff0~0_In1749382372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749382372, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749382372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749382372, ~weak$$choice2~0=~weak$$choice2~0_In1749382372} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749382372, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1749382372|, ~z$w_buff0~0=~z$w_buff0~0_In1749382372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749382372, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749382372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749382372, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1749382372|, ~weak$$choice2~0=~weak$$choice2~0_In1749382372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-07 17:50:54,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In933430139 256)))) (or (and .cse0 (= ~z$w_buff1~0_In933430139 |ULTIMATE.start_main_#t~ite33_Out933430139|) (= |ULTIMATE.start_main_#t~ite34_Out933430139| |ULTIMATE.start_main_#t~ite33_Out933430139|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In933430139 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In933430139 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In933430139 256) 0) (and (= (mod ~z$r_buff1_thd0~0_In933430139 256) 0) .cse1)))) (and (= ~z$w_buff1~0_In933430139 |ULTIMATE.start_main_#t~ite34_Out933430139|) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In933430139| |ULTIMATE.start_main_#t~ite33_Out933430139|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In933430139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933430139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In933430139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933430139, ~z$w_buff1~0=~z$w_buff1~0_In933430139, ~weak$$choice2~0=~weak$$choice2~0_In933430139, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In933430139|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In933430139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933430139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In933430139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933430139, ~z$w_buff1~0=~z$w_buff1~0_In933430139, ~weak$$choice2~0=~weak$$choice2~0_In933430139, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out933430139|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out933430139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:50:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:50:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-506898709 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-506898709| ~z$r_buff1_thd0~0_In-506898709) (= |ULTIMATE.start_main_#t~ite45_Out-506898709| |ULTIMATE.start_main_#t~ite46_Out-506898709|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-506898709 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-506898709 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-506898709 256) 0)) (= (mod ~z$w_buff0_used~0_In-506898709 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite45_In-506898709| |ULTIMATE.start_main_#t~ite45_Out-506898709|) (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-506898709| ~z$r_buff1_thd0~0_In-506898709)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-506898709, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-506898709, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-506898709, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-506898709, ~weak$$choice2~0=~weak$$choice2~0_In-506898709, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-506898709|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-506898709, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-506898709, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-506898709, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-506898709, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-506898709|, ~weak$$choice2~0=~weak$$choice2~0_In-506898709, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-506898709|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:50:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:50:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 17:50:54,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:50:54 BasicIcfg [2019-12-07 17:50:54,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:50:54,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:50:54,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:50:54,597 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:50:54,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:50:34" (3/4) ... [2019-12-07 17:50:54,599 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:50:54,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1277~0.base_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21| 1) |v_#valid_73|) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21|) 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1277~0.base_21| 4) |v_#length_29|) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21|) |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1277~0.base=|v_ULTIMATE.start_main_~#t1277~0.base_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_23|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_~#t1277~0.offset=|v_ULTIMATE.start_main_~#t1277~0.offset_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_22|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_18|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1277~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1280~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1277~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1279~0.offset, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1278~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1279~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-07 17:50:54,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1278~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1278~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1278~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13|) |v_ULTIMATE.start_main_~#t1278~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1278~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_13|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1278~0.base, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-07 17:50:54,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11|) |v_ULTIMATE.start_main_~#t1279~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t1279~0.base_11|)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1279~0.offset_10|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1279~0.base_11|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1279~0.base_11| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1279~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1279~0.offset] because there is no mapped edge [2019-12-07 17:50:54,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1280~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13|) |v_ULTIMATE.start_main_~#t1280~0.offset_11| 3)) |v_#memory_int_17|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1280~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1280~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1280~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_11|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1280~0.base] because there is no mapped edge [2019-12-07 17:50:54,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_16 0))) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_16, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_16, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 17:50:54,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_62 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:50:54,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_12) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:50:54,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In739847724 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In739847724 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out739847724| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In739847724 |P3Thread1of1ForFork3_#t~ite11_Out739847724|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In739847724, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In739847724} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In739847724, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In739847724, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out739847724|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-07 17:50:54,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1845423105 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1845423105 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1845423105 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1845423105 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1845423105|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1845423105 |P3Thread1of1ForFork3_#t~ite12_Out-1845423105|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1845423105, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845423105, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1845423105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845423105} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1845423105, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1845423105, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1845423105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1845423105, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1845423105|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-07 17:50:54,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1412050353 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1412050353 256) 0))) (or (and (= ~z~0_In-1412050353 |P2Thread1of1ForFork2_#t~ite3_Out-1412050353|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1412050353 |P2Thread1of1ForFork2_#t~ite3_Out-1412050353|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1412050353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412050353, ~z$w_buff1~0=~z$w_buff1~0_In-1412050353, ~z~0=~z~0_In-1412050353} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1412050353|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1412050353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1412050353, ~z$w_buff1~0=~z$w_buff1~0_In-1412050353, ~z~0=~z~0_In-1412050353} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 17:50:54,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_32 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-07 17:50:54,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1483846188 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1483846188 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1483846188|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1483846188 |P2Thread1of1ForFork2_#t~ite5_Out-1483846188|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1483846188} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1483846188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1483846188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1483846188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 17:50:54,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1748848408 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1748848408 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1748848408 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1748848408 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1748848408|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1748848408| ~z$w_buff1_used~0_In-1748848408) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1748848408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1748848408, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1748848408} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1748848408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748848408, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1748848408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1748848408, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1748848408} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 17:50:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2073946924 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In2073946924 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out2073946924| 0)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2073946924| ~z$r_buff0_thd3~0_In2073946924) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2073946924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2073946924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2073946924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2073946924, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2073946924|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 17:50:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In935403897 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In935403897 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In935403897 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In935403897 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out935403897|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In935403897 |P2Thread1of1ForFork2_#t~ite8_Out935403897|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In935403897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In935403897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In935403897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In935403897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In935403897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In935403897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In935403897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In935403897, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out935403897|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 17:50:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite8_34| v_~z$r_buff1_thd3~0_64) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_34|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_33|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 17:50:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1693755387 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1693755387 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In-1693755387 ~z$r_buff0_thd4~0_Out-1693755387))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1693755387)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1693755387} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693755387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1693755387, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1693755387|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-07 17:50:54,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In824674567 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In824674567 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In824674567 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In824674567 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out824674567| ~z$r_buff1_thd4~0_In824674567)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out824674567| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In824674567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In824674567, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In824674567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In824674567} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In824674567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In824674567, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out824674567|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In824674567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In824674567} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-07 17:50:54,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= |v_P3Thread1of1ForFork3_#t~ite14_44| v_~z$r_buff1_thd4~0_75)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_43|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:50:54,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_62) 1 0)) 0 1) v_~main$tmp_guard0~0_8)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-07 17:50:54,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In582267171 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In582267171 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out582267171| |ULTIMATE.start_main_#t~ite20_Out582267171|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out582267171| ~z$w_buff1~0_In582267171) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out582267171| ~z~0_In582267171) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In582267171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In582267171, ~z$w_buff1~0=~z$w_buff1~0_In582267171, ~z~0=~z~0_In582267171} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out582267171|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In582267171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In582267171, ~z$w_buff1~0=~z$w_buff1~0_In582267171, ~z~0=~z~0_In582267171, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out582267171|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 17:50:54,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1179881601 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1179881601 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1179881601| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out1179881601| ~z$w_buff0_used~0_In1179881601) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179881601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179881601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179881601, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1179881601|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 17:50:54,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-225272658 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-225272658 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-225272658 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-225272658 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-225272658| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-225272658 |ULTIMATE.start_main_#t~ite22_Out-225272658|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-225272658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225272658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-225272658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225272658} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-225272658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-225272658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-225272658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225272658, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-225272658|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 17:50:54,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1488748305 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1488748305 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1488748305|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1488748305 |ULTIMATE.start_main_#t~ite23_Out-1488748305|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1488748305, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488748305} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1488748305, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488748305, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1488748305|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 17:50:54,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1579771423 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1579771423 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1579771423 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1579771423 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out1579771423| ~z$r_buff1_thd0~0_In1579771423)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite24_Out1579771423| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1579771423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1579771423, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1579771423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1579771423} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1579771423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1579771423, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1579771423, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1579771423|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1579771423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 17:50:54,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1749382372 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_In1749382372| |ULTIMATE.start_main_#t~ite30_Out1749382372|) (= |ULTIMATE.start_main_#t~ite31_Out1749382372| ~z$w_buff0~0_In1749382372)) (and (= |ULTIMATE.start_main_#t~ite31_Out1749382372| |ULTIMATE.start_main_#t~ite30_Out1749382372|) (= |ULTIMATE.start_main_#t~ite30_Out1749382372| ~z$w_buff0~0_In1749382372) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1749382372 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1749382372 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1749382372 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In1749382372 256)) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749382372, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In1749382372|, ~z$w_buff0~0=~z$w_buff0~0_In1749382372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749382372, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749382372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749382372, ~weak$$choice2~0=~weak$$choice2~0_In1749382372} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749382372, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1749382372|, ~z$w_buff0~0=~z$w_buff0~0_In1749382372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749382372, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1749382372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749382372, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1749382372|, ~weak$$choice2~0=~weak$$choice2~0_In1749382372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-07 17:50:54,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In933430139 256)))) (or (and .cse0 (= ~z$w_buff1~0_In933430139 |ULTIMATE.start_main_#t~ite33_Out933430139|) (= |ULTIMATE.start_main_#t~ite34_Out933430139| |ULTIMATE.start_main_#t~ite33_Out933430139|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In933430139 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In933430139 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In933430139 256) 0) (and (= (mod ~z$r_buff1_thd0~0_In933430139 256) 0) .cse1)))) (and (= ~z$w_buff1~0_In933430139 |ULTIMATE.start_main_#t~ite34_Out933430139|) (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In933430139| |ULTIMATE.start_main_#t~ite33_Out933430139|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In933430139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933430139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In933430139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933430139, ~z$w_buff1~0=~z$w_buff1~0_In933430139, ~weak$$choice2~0=~weak$$choice2~0_In933430139, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In933430139|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In933430139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In933430139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In933430139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933430139, ~z$w_buff1~0=~z$w_buff1~0_In933430139, ~weak$$choice2~0=~weak$$choice2~0_In933430139, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out933430139|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out933430139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:50:54,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:50:54,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-506898709 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-506898709| ~z$r_buff1_thd0~0_In-506898709) (= |ULTIMATE.start_main_#t~ite45_Out-506898709| |ULTIMATE.start_main_#t~ite46_Out-506898709|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-506898709 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-506898709 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-506898709 256) 0)) (= (mod ~z$w_buff0_used~0_In-506898709 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite45_In-506898709| |ULTIMATE.start_main_#t~ite45_Out-506898709|) (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-506898709| ~z$r_buff1_thd0~0_In-506898709)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-506898709, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-506898709, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-506898709, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-506898709, ~weak$$choice2~0=~weak$$choice2~0_In-506898709, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-506898709|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-506898709, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-506898709, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-506898709, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-506898709, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-506898709|, ~weak$$choice2~0=~weak$$choice2~0_In-506898709, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-506898709|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:50:54,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:50:54,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 17:50:54,657 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_24a978d5-db97-4d9d-92a4-a42de93ba5a3/bin/uautomizer/witness.graphml [2019-12-07 17:50:54,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:50:54,658 INFO L168 Benchmark]: Toolchain (without parser) took 21251.82 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 940.8 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,658 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:50:54,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,659 INFO L168 Benchmark]: Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,659 INFO L168 Benchmark]: RCFGBuilder took 382.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,660 INFO L168 Benchmark]: TraceAbstraction took 20305.68 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,660 INFO L168 Benchmark]: Witness Printer took 60.23 ms. Allocated memory is still 3.6 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:50:54,661 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 434.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 382.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20305.68 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 60.23 ms. Allocated memory is still 3.6 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L833] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L835] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L837] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 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) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 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 [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2378 SDtfs, 2139 SDslu, 6598 SDs, 0 SdLazy, 3878 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 38 SyntacticMatches, 22 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52914occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 32446 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 201224 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...