./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.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_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/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 22587ad177ea0e584b685748a24c1c1e01082f28 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:59:56,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:59:56,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:59:56,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:59:56,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:59:56,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:59:56,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:59:56,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:59:56,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:59:56,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:59:56,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:59:56,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:59:56,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:59:56,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:59:56,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:59:56,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:59:56,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:59:56,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:59:56,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:59:56,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:59:56,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:59:56,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:59:56,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:59:56,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:59:56,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:59:56,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:59:56,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:59:56,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:59:56,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:59:56,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:59:56,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:59:56,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:59:56,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:59:56,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:59:56,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:59:56,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:59:56,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:59:56,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:59:56,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:59:56,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:59:56,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:59:56,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:59:56,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:59:56,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:59:56,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:59:56,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:59:56,119 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:59:56,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:59:56,120 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:59:56,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:59:56,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:59:56,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:59:56,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:59:56,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:59:56,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:59:56,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:59:56,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:59:56,121 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:59:56,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:59:56,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:59:56,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:59:56,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:59:56,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:59:56,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:59:56,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:59:56,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:59:56,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:59:56,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:59:56,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:59:56,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:59:56,123 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:59:56,123 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_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/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 -> 22587ad177ea0e584b685748a24c1c1e01082f28 [2019-12-07 16:59:56,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:59:56,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:59:56,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:59:56,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:59:56,249 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:59:56,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i [2019-12-07 16:59:56,287 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/data/0a5de5eb3/094487c0d2cf4e4eb7561e90cdfd1e49/FLAG0c3de34c0 [2019-12-07 16:59:56,829 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:59:56,829 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i [2019-12-07 16:59:56,841 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/data/0a5de5eb3/094487c0d2cf4e4eb7561e90cdfd1e49/FLAG0c3de34c0 [2019-12-07 16:59:57,281 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/data/0a5de5eb3/094487c0d2cf4e4eb7561e90cdfd1e49 [2019-12-07 16:59:57,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:59:57,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:59:57,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:59:57,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:59:57,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:59:57,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd384cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57, skipping insertion in model container [2019-12-07 16:59:57,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:59:57,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:59:57,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:59:57,584 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:59:57,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:59:57,690 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:59:57,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57 WrapperNode [2019-12-07 16:59:57,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:59:57,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:59:57,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:59:57,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:59:57,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:59:57,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:59:57,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:59:57,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:59:57,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... [2019-12-07 16:59:57,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:59:57,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:59:57,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:59:57,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:59:57,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/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 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:59:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:59:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:59:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:59:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:59:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 16:59:57,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 16:59:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:59:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:59:57,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:59:57,804 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 16:59:58,129 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:59:58,130 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:59:58,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:59:58 BoogieIcfgContainer [2019-12-07 16:59:58,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:59:58,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:59:58,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:59:58,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:59:58,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:59:57" (1/3) ... [2019-12-07 16:59:58,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6b871c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:59:58, skipping insertion in model container [2019-12-07 16:59:58,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:57" (2/3) ... [2019-12-07 16:59:58,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6b871c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:59:58, skipping insertion in model container [2019-12-07 16:59:58,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:59:58" (3/3) ... [2019-12-07 16:59:58,136 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2019-12-07 16:59:58,142 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:59:58,142 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:59:58,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:59:58,148 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:59:58,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,192 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,193 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,193 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,193 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,193 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,193 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,193 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,194 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,194 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,194 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,194 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,194 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,196 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,196 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,196 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,196 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,196 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,196 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,197 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,197 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,197 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,197 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,197 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,197 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:59:58,210 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 16:59:58,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:59:58,223 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:59:58,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:59:58,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:59:58,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:59:58,223 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:59:58,223 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:59:58,223 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:59:58,237 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-07 16:59:58,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-07 16:59:58,299 INFO L134 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-07 16:59:58,300 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:59:58,309 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 569 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:59:58,321 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-07 16:59:58,356 INFO L134 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-07 16:59:58,356 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:59:58,360 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 569 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:59:58,372 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 16:59:58,373 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:00:01,191 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 17:00:01,382 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 17:00:01,501 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-07 17:00:01,501 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-07 17:00:01,503 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-07 17:00:02,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-07 17:00:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-07 17:00:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:00:02,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:02,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:02,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-07 17:00:02,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:02,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576422082] [2019-12-07 17:00:02,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:02,906 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:00:02,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576422082] [2019-12-07 17:00:02,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:02,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:00:02,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623623765] [2019-12-07 17:00:02,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:02,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:02,921 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-07 17:00:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:03,204 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-07 17:00:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:00:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:03,378 INFO L225 Difference]: With dead ends: 23966 [2019-12-07 17:00:03,379 INFO L226 Difference]: Without dead ends: 22574 [2019-12-07 17:00:03,379 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:00:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-07 17:00:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-07 17:00:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-07 17:00:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-07 17:00:04,098 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-07 17:00:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:04,099 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-07 17:00:04,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-07 17:00:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:00:04,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:04,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:04,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-07 17:00:04,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:04,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761506297] [2019-12-07 17:00:04,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:04,162 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:00:04,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761506297] [2019-12-07 17:00:04,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:04,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:00:04,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728649370] [2019-12-07 17:00:04,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:04,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:04,164 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-07 17:00:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:04,519 INFO L93 Difference]: Finished difference Result 34006 states and 143332 transitions. [2019-12-07 17:00:04,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:04,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:00:04,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:04,757 INFO L225 Difference]: With dead ends: 34006 [2019-12-07 17:00:04,757 INFO L226 Difference]: Without dead ends: 33954 [2019-12-07 17:00:04,758 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:00:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2019-12-07 17:00:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 30266. [2019-12-07 17:00:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-07 17:00:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 129516 transitions. [2019-12-07 17:00:05,604 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 129516 transitions. Word has length 15 [2019-12-07 17:00:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:05,605 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 129516 transitions. [2019-12-07 17:00:05,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 129516 transitions. [2019-12-07 17:00:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:05,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:05,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:05,613 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-07 17:00:05,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:05,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383144139] [2019-12-07 17:00:05,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:05,644 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:00:05,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383144139] [2019-12-07 17:00:05,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:05,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:05,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317425088] [2019-12-07 17:00:05,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:05,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:05,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:05,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:05,645 INFO L87 Difference]: Start difference. First operand 30266 states and 129516 transitions. Second operand 3 states. [2019-12-07 17:00:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:05,818 INFO L93 Difference]: Finished difference Result 39490 states and 165892 transitions. [2019-12-07 17:00:05,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:05,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:00:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:05,907 INFO L225 Difference]: With dead ends: 39490 [2019-12-07 17:00:05,907 INFO L226 Difference]: Without dead ends: 39490 [2019-12-07 17:00:05,908 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:00:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39490 states. [2019-12-07 17:00:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39490 to 32622. [2019-12-07 17:00:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-07 17:00:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 139128 transitions. [2019-12-07 17:00:06,738 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 139128 transitions. Word has length 18 [2019-12-07 17:00:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:06,739 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 139128 transitions. [2019-12-07 17:00:06,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 139128 transitions. [2019-12-07 17:00:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:06,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:06,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:06,745 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-07 17:00:06,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:06,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637995241] [2019-12-07 17:00:06,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:06,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637995241] [2019-12-07 17:00:06,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:06,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:00:06,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739026336] [2019-12-07 17:00:06,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:06,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:06,789 INFO L87 Difference]: Start difference. First operand 32622 states and 139128 transitions. Second operand 4 states. [2019-12-07 17:00:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:07,038 INFO L93 Difference]: Finished difference Result 39306 states and 164888 transitions. [2019-12-07 17:00:07,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:07,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:00:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:07,124 INFO L225 Difference]: With dead ends: 39306 [2019-12-07 17:00:07,124 INFO L226 Difference]: Without dead ends: 39270 [2019-12-07 17:00:07,125 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:00:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39270 states. [2019-12-07 17:00:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39270 to 34278. [2019-12-07 17:00:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34278 states. [2019-12-07 17:00:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34278 states to 34278 states and 145700 transitions. [2019-12-07 17:00:07,959 INFO L78 Accepts]: Start accepts. Automaton has 34278 states and 145700 transitions. Word has length 18 [2019-12-07 17:00:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:07,959 INFO L462 AbstractCegarLoop]: Abstraction has 34278 states and 145700 transitions. [2019-12-07 17:00:07,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34278 states and 145700 transitions. [2019-12-07 17:00:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:07,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:07,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:07,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-07 17:00:07,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:07,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319578597] [2019-12-07 17:00:07,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:08,001 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:00:08,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319578597] [2019-12-07 17:00:08,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:08,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:00:08,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240175535] [2019-12-07 17:00:08,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:08,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:08,002 INFO L87 Difference]: Start difference. First operand 34278 states and 145700 transitions. Second operand 4 states. [2019-12-07 17:00:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:08,261 INFO L93 Difference]: Finished difference Result 43030 states and 180576 transitions. [2019-12-07 17:00:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:08,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:00:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:08,361 INFO L225 Difference]: With dead ends: 43030 [2019-12-07 17:00:08,361 INFO L226 Difference]: Without dead ends: 42978 [2019-12-07 17:00:08,361 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:00:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42978 states. [2019-12-07 17:00:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42978 to 35550. [2019-12-07 17:00:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-07 17:00:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 151224 transitions. [2019-12-07 17:00:09,218 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 151224 transitions. Word has length 18 [2019-12-07 17:00:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:09,218 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 151224 transitions. [2019-12-07 17:00:09,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 151224 transitions. [2019-12-07 17:00:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:00:09,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:09,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:09,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1801202898, now seen corresponding path program 1 times [2019-12-07 17:00:09,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:09,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086683693] [2019-12-07 17:00:09,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:09,283 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:00:09,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086683693] [2019-12-07 17:00:09,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:09,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:09,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665596577] [2019-12-07 17:00:09,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:09,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:09,285 INFO L87 Difference]: Start difference. First operand 35550 states and 151224 transitions. Second operand 4 states. [2019-12-07 17:00:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:09,440 INFO L93 Difference]: Finished difference Result 30593 states and 119559 transitions. [2019-12-07 17:00:09,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:09,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 17:00:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:09,498 INFO L225 Difference]: With dead ends: 30593 [2019-12-07 17:00:09,498 INFO L226 Difference]: Without dead ends: 28181 [2019-12-07 17:00:09,499 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:00:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28181 states. [2019-12-07 17:00:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28181 to 28181. [2019-12-07 17:00:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28181 states. [2019-12-07 17:00:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28181 states to 28181 states and 111222 transitions. [2019-12-07 17:00:10,022 INFO L78 Accepts]: Start accepts. Automaton has 28181 states and 111222 transitions. Word has length 20 [2019-12-07 17:00:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:10,022 INFO L462 AbstractCegarLoop]: Abstraction has 28181 states and 111222 transitions. [2019-12-07 17:00:10,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28181 states and 111222 transitions. [2019-12-07 17:00:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:10,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:10,029 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:00:10,029 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -348621301, now seen corresponding path program 1 times [2019-12-07 17:00:10,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:10,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093929263] [2019-12-07 17:00:10,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:10,079 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:00:10,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093929263] [2019-12-07 17:00:10,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:10,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:00:10,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535264066] [2019-12-07 17:00:10,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:10,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:10,080 INFO L87 Difference]: Start difference. First operand 28181 states and 111222 transitions. Second operand 3 states. [2019-12-07 17:00:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:10,285 INFO L93 Difference]: Finished difference Result 42819 states and 164082 transitions. [2019-12-07 17:00:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:10,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:00:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:10,363 INFO L225 Difference]: With dead ends: 42819 [2019-12-07 17:00:10,363 INFO L226 Difference]: Without dead ends: 42107 [2019-12-07 17:00:10,364 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:00:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42107 states. [2019-12-07 17:00:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42107 to 41295. [2019-12-07 17:00:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41295 states. [2019-12-07 17:00:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41295 states to 41295 states and 159409 transitions. [2019-12-07 17:00:11,133 INFO L78 Accepts]: Start accepts. Automaton has 41295 states and 159409 transitions. Word has length 21 [2019-12-07 17:00:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:11,134 INFO L462 AbstractCegarLoop]: Abstraction has 41295 states and 159409 transitions. [2019-12-07 17:00:11,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 41295 states and 159409 transitions. [2019-12-07 17:00:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:11,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:11,144 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:00:11,144 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 281464718, now seen corresponding path program 1 times [2019-12-07 17:00:11,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:11,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169526937] [2019-12-07 17:00:11,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:11,193 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:00:11,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169526937] [2019-12-07 17:00:11,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:11,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:00:11,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409578489] [2019-12-07 17:00:11,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:11,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:11,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:11,194 INFO L87 Difference]: Start difference. First operand 41295 states and 159409 transitions. Second operand 5 states. [2019-12-07 17:00:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:11,298 INFO L93 Difference]: Finished difference Result 23185 states and 77162 transitions. [2019-12-07 17:00:11,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:11,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 17:00:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:11,326 INFO L225 Difference]: With dead ends: 23185 [2019-12-07 17:00:11,326 INFO L226 Difference]: Without dead ends: 20227 [2019-12-07 17:00:11,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20227 states. [2019-12-07 17:00:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20227 to 20227. [2019-12-07 17:00:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20227 states. [2019-12-07 17:00:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20227 states to 20227 states and 67176 transitions. [2019-12-07 17:00:11,615 INFO L78 Accepts]: Start accepts. Automaton has 20227 states and 67176 transitions. Word has length 21 [2019-12-07 17:00:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:11,615 INFO L462 AbstractCegarLoop]: Abstraction has 20227 states and 67176 transitions. [2019-12-07 17:00:11,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20227 states and 67176 transitions. [2019-12-07 17:00:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:00:11,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:11,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:11,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1933146031, now seen corresponding path program 1 times [2019-12-07 17:00:11,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:11,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019391137] [2019-12-07 17:00:11,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:11,683 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:00:11,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019391137] [2019-12-07 17:00:11,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:11,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:11,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135058083] [2019-12-07 17:00:11,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:11,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:11,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:11,684 INFO L87 Difference]: Start difference. First operand 20227 states and 67176 transitions. Second operand 6 states. [2019-12-07 17:00:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:11,749 INFO L93 Difference]: Finished difference Result 6576 states and 19503 transitions. [2019-12-07 17:00:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:11,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 17:00:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:11,755 INFO L225 Difference]: With dead ends: 6576 [2019-12-07 17:00:11,755 INFO L226 Difference]: Without dead ends: 5172 [2019-12-07 17:00:11,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-12-07 17:00:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 4585. [2019-12-07 17:00:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4585 states. [2019-12-07 17:00:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 13281 transitions. [2019-12-07 17:00:11,834 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 13281 transitions. Word has length 22 [2019-12-07 17:00:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:11,834 INFO L462 AbstractCegarLoop]: Abstraction has 4585 states and 13281 transitions. [2019-12-07 17:00:11,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 13281 transitions. [2019-12-07 17:00:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:00:11,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:11,839 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:00:11,839 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-07 17:00:11,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:11,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177182426] [2019-12-07 17:00:11,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:11,886 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:00:11,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177182426] [2019-12-07 17:00:11,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:11,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:11,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828632444] [2019-12-07 17:00:11,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:11,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:11,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:11,888 INFO L87 Difference]: Start difference. First operand 4585 states and 13281 transitions. Second operand 5 states. [2019-12-07 17:00:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,017 INFO L93 Difference]: Finished difference Result 5713 states and 16111 transitions. [2019-12-07 17:00:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:12,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 17:00:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,023 INFO L225 Difference]: With dead ends: 5713 [2019-12-07 17:00:12,023 INFO L226 Difference]: Without dead ends: 5711 [2019-12-07 17:00:12,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-12-07 17:00:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4866. [2019-12-07 17:00:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4866 states. [2019-12-07 17:00:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 14046 transitions. [2019-12-07 17:00:12,075 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 14046 transitions. Word has length 31 [2019-12-07 17:00:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,075 INFO L462 AbstractCegarLoop]: Abstraction has 4866 states and 14046 transitions. [2019-12-07 17:00:12,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 14046 transitions. [2019-12-07 17:00:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:00:12,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,080 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:00:12,080 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1138439690, now seen corresponding path program 1 times [2019-12-07 17:00:12,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336566517] [2019-12-07 17:00:12,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,100 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:00:12,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336566517] [2019-12-07 17:00:12,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:12,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560992347] [2019-12-07 17:00:12,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:12,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:12,101 INFO L87 Difference]: Start difference. First operand 4866 states and 14046 transitions. Second operand 3 states. [2019-12-07 17:00:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,132 INFO L93 Difference]: Finished difference Result 5854 states and 16116 transitions. [2019-12-07 17:00:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:12,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 17:00:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,137 INFO L225 Difference]: With dead ends: 5854 [2019-12-07 17:00:12,137 INFO L226 Difference]: Without dead ends: 5854 [2019-12-07 17:00:12,137 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:00:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-07 17:00:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 4824. [2019-12-07 17:00:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2019-12-07 17:00:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 13370 transitions. [2019-12-07 17:00:12,186 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 13370 transitions. Word has length 31 [2019-12-07 17:00:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,187 INFO L462 AbstractCegarLoop]: Abstraction has 4824 states and 13370 transitions. [2019-12-07 17:00:12,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 13370 transitions. [2019-12-07 17:00:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:00:12,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,191 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] [2019-12-07 17:00:12,192 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -402711057, now seen corresponding path program 1 times [2019-12-07 17:00:12,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027290361] [2019-12-07 17:00:12,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:12,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027290361] [2019-12-07 17:00:12,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:00:12,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835387218] [2019-12-07 17:00:12,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:12,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:12,242 INFO L87 Difference]: Start difference. First operand 4824 states and 13370 transitions. Second operand 3 states. [2019-12-07 17:00:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,261 INFO L93 Difference]: Finished difference Result 4724 states and 13045 transitions. [2019-12-07 17:00:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:12,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 17:00:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,266 INFO L225 Difference]: With dead ends: 4724 [2019-12-07 17:00:12,266 INFO L226 Difference]: Without dead ends: 4724 [2019-12-07 17:00:12,266 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:00:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2019-12-07 17:00:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4148. [2019-12-07 17:00:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2019-12-07 17:00:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 11456 transitions. [2019-12-07 17:00:12,306 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 11456 transitions. Word has length 32 [2019-12-07 17:00:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,306 INFO L462 AbstractCegarLoop]: Abstraction has 4148 states and 11456 transitions. [2019-12-07 17:00:12,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 11456 transitions. [2019-12-07 17:00:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:00:12,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:12,310 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1471954053, now seen corresponding path program 1 times [2019-12-07 17:00:12,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226234069] [2019-12-07 17:00:12,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,356 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:00:12,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226234069] [2019-12-07 17:00:12,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:12,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38628272] [2019-12-07 17:00:12,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:12,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:12,358 INFO L87 Difference]: Start difference. First operand 4148 states and 11456 transitions. Second operand 5 states. [2019-12-07 17:00:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,491 INFO L93 Difference]: Finished difference Result 4998 states and 13531 transitions. [2019-12-07 17:00:12,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:12,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 17:00:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,496 INFO L225 Difference]: With dead ends: 4998 [2019-12-07 17:00:12,496 INFO L226 Difference]: Without dead ends: 4996 [2019-12-07 17:00:12,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2019-12-07 17:00:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 3931. [2019-12-07 17:00:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3931 states. [2019-12-07 17:00:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 10865 transitions. [2019-12-07 17:00:12,539 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 10865 transitions. Word has length 33 [2019-12-07 17:00:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,539 INFO L462 AbstractCegarLoop]: Abstraction has 3931 states and 10865 transitions. [2019-12-07 17:00:12,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 10865 transitions. [2019-12-07 17:00:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:00:12,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:12,543 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1577003715, now seen corresponding path program 1 times [2019-12-07 17:00:12,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294421718] [2019-12-07 17:00:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,575 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:00:12,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294421718] [2019-12-07 17:00:12,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:12,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545538609] [2019-12-07 17:00:12,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:12,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:12,577 INFO L87 Difference]: Start difference. First operand 3931 states and 10865 transitions. Second operand 4 states. [2019-12-07 17:00:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,603 INFO L93 Difference]: Finished difference Result 5465 states and 14720 transitions. [2019-12-07 17:00:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:12,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 17:00:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,608 INFO L225 Difference]: With dead ends: 5465 [2019-12-07 17:00:12,608 INFO L226 Difference]: Without dead ends: 3865 [2019-12-07 17:00:12,609 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:00:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-12-07 17:00:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3839. [2019-12-07 17:00:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3839 states. [2019-12-07 17:00:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10483 transitions. [2019-12-07 17:00:12,651 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10483 transitions. Word has length 33 [2019-12-07 17:00:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,652 INFO L462 AbstractCegarLoop]: Abstraction has 3839 states and 10483 transitions. [2019-12-07 17:00:12,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10483 transitions. [2019-12-07 17:00:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:00:12,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:12,656 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,656 INFO L82 PathProgramCache]: Analyzing trace with hash 905925005, now seen corresponding path program 2 times [2019-12-07 17:00:12,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571445582] [2019-12-07 17:00:12,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,712 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:00:12,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571445582] [2019-12-07 17:00:12,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:00:12,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913852606] [2019-12-07 17:00:12,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:00:12,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:00:12,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:12,714 INFO L87 Difference]: Start difference. First operand 3839 states and 10483 transitions. Second operand 7 states. [2019-12-07 17:00:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,788 INFO L93 Difference]: Finished difference Result 2748 states and 7992 transitions. [2019-12-07 17:00:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:12,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 17:00:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,791 INFO L225 Difference]: With dead ends: 2748 [2019-12-07 17:00:12,791 INFO L226 Difference]: Without dead ends: 2312 [2019-12-07 17:00:12,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:00:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-12-07 17:00:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1894. [2019-12-07 17:00:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-12-07 17:00:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 5758 transitions. [2019-12-07 17:00:12,812 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 5758 transitions. Word has length 33 [2019-12-07 17:00:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,812 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 5758 transitions. [2019-12-07 17:00:12,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:00:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 5758 transitions. [2019-12-07 17:00:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:00:12,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,815 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] [2019-12-07 17:00:12,815 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash -333210519, now seen corresponding path program 1 times [2019-12-07 17:00:12,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471925390] [2019-12-07 17:00:12,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,862 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:00:12,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471925390] [2019-12-07 17:00:12,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:00:12,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561557660] [2019-12-07 17:00:12,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:12,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:12,863 INFO L87 Difference]: Start difference. First operand 1894 states and 5758 transitions. Second operand 4 states. [2019-12-07 17:00:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,882 INFO L93 Difference]: Finished difference Result 2334 states and 6702 transitions. [2019-12-07 17:00:12,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:12,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 17:00:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,883 INFO L225 Difference]: With dead ends: 2334 [2019-12-07 17:00:12,884 INFO L226 Difference]: Without dead ends: 1413 [2019-12-07 17:00:12,884 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:00:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-07 17:00:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2019-12-07 17:00:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-07 17:00:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 3879 transitions. [2019-12-07 17:00:12,897 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 3879 transitions. Word has length 47 [2019-12-07 17:00:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,898 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 3879 transitions. [2019-12-07 17:00:12,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 3879 transitions. [2019-12-07 17:00:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:00:12,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,900 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] [2019-12-07 17:00:12,900 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash 639928323, now seen corresponding path program 2 times [2019-12-07 17:00:12,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945340156] [2019-12-07 17:00:12,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:12,951 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:00:12,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945340156] [2019-12-07 17:00:12,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:12,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:00:12,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395517597] [2019-12-07 17:00:12,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:12,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:12,952 INFO L87 Difference]: Start difference. First operand 1413 states and 3879 transitions. Second operand 5 states. [2019-12-07 17:00:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:12,984 INFO L93 Difference]: Finished difference Result 1835 states and 4837 transitions. [2019-12-07 17:00:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:12,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 17:00:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:12,985 INFO L225 Difference]: With dead ends: 1835 [2019-12-07 17:00:12,985 INFO L226 Difference]: Without dead ends: 419 [2019-12-07 17:00:12,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-07 17:00:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-07 17:00:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 17:00:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 893 transitions. [2019-12-07 17:00:12,990 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 893 transitions. Word has length 47 [2019-12-07 17:00:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:12,990 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 893 transitions. [2019-12-07 17:00:12,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 893 transitions. [2019-12-07 17:00:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:00:12,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:12,991 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] [2019-12-07 17:00:12,992 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1882928771, now seen corresponding path program 3 times [2019-12-07 17:00:12,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:12,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390433437] [2019-12-07 17:00:12,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:13,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390433437] [2019-12-07 17:00:13,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:13,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:00:13,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441806599] [2019-12-07 17:00:13,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:00:13,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:00:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:00:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:13,046 INFO L87 Difference]: Start difference. First operand 419 states and 893 transitions. Second operand 7 states. [2019-12-07 17:00:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:13,150 INFO L93 Difference]: Finished difference Result 802 states and 1670 transitions. [2019-12-07 17:00:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:00:13,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 17:00:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:13,151 INFO L225 Difference]: With dead ends: 802 [2019-12-07 17:00:13,151 INFO L226 Difference]: Without dead ends: 540 [2019-12-07 17:00:13,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:00:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-07 17:00:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 482. [2019-12-07 17:00:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-07 17:00:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 997 transitions. [2019-12-07 17:00:13,156 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 997 transitions. Word has length 47 [2019-12-07 17:00:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:13,156 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 997 transitions. [2019-12-07 17:00:13,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:00:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 997 transitions. [2019-12-07 17:00:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:00:13,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:13,156 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] [2019-12-07 17:00:13,157 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:13,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 4 times [2019-12-07 17:00:13,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:00:13,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907428030] [2019-12-07 17:00:13,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:00:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:00:13,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:00:13,220 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:00:13,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36|)) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1365~0.base_36| 4) |v_#length_27|) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36| 1) |v_#valid_83|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (= |v_#NULL.offset_5| 0) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= 0 |v_ULTIMATE.start_main_~#t1365~0.offset_23|) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1365~0.base_36|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36|) |v_ULTIMATE.start_main_~#t1365~0.offset_23| 0))) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_24|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ULTIMATE.start_main_~#t1365~0.offset=|v_ULTIMATE.start_main_~#t1365~0.offset_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ULTIMATE.start_main_~#t1365~0.base=|v_ULTIMATE.start_main_~#t1365~0.base_36|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_24|, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_17|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_37|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_~#t1366~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1365~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1365~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1366~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1368~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1367~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1368~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:00:13,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1366~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) |v_ULTIMATE.start_main_~#t1366~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1366~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1366~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_11|, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1366~0.base, ULTIMATE.start_main_~#t1366~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:00:13,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1367~0.offset_10| 0) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1367~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11|) |v_ULTIMATE.start_main_~#t1367~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1367~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1367~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1367~0.base] because there is no mapped edge [2019-12-07 17:00:13,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1368~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1368~0.base_13|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13|) |v_ULTIMATE.start_main_~#t1368~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1368~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t1368~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_13|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1368~0.base, ULTIMATE.start_main_~#t1368~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:00:13,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20)) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~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{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~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[~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] because there is no mapped edge [2019-12-07 17:00:13,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~a~0_44 1) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_51 1) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_23|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:00:13,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~x~0_33 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_15)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:00:13,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In844111362 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In844111362 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In844111362 |P3Thread1of1ForFork1_#t~ite28_Out844111362|)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out844111362| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In844111362, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In844111362} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In844111362, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out844111362|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In844111362} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:00:13,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In1333068116 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1333068116 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1333068116 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1333068116 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1333068116|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1333068116 |P3Thread1of1ForFork1_#t~ite29_Out1333068116|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1333068116, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333068116, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1333068116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333068116} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1333068116, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1333068116|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333068116, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1333068116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333068116} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 17:00:13,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1726324773 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1726324773 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-1726324773 ~z$r_buff0_thd4~0_In-1726324773))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-1726324773 0)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726324773, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1726324773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726324773, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1726324773, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1726324773|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:00:13,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1495303276 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1495303276 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1495303276 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1495303276 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite31_Out1495303276| ~z$r_buff1_thd4~0_In1495303276) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork1_#t~ite31_Out1495303276| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1495303276, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1495303276, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1495303276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495303276} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1495303276, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1495303276, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1495303276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495303276, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1495303276|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:00:13,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#t~ite31_60| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:00:13,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite23_31| |v_P2Thread1of1ForFork0_#t~ite23_30|) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_44|) (= |v_P2Thread1of1ForFork0_#t~ite22_29| |v_P2Thread1of1ForFork0_#t~ite22_28|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0))) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_29|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_13|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_28|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_30|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_44|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_29|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_27|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 17:00:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:00:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:00:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1442517328 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1442517328 256) 0))) (or (and (= ~z~0_In-1442517328 |ULTIMATE.start_main_#t~ite36_Out-1442517328|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1442517328 |ULTIMATE.start_main_#t~ite36_Out-1442517328|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1442517328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442517328, ~z$w_buff1~0=~z$w_buff1~0_In-1442517328, ~z~0=~z~0_In-1442517328} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1442517328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442517328, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1442517328|, ~z$w_buff1~0=~z$w_buff1~0_In-1442517328, ~z~0=~z~0_In-1442517328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 17:00:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 17:00:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1123934084 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1123934084 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1123934084| ~z$w_buff0_used~0_In-1123934084) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1123934084| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1123934084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1123934084} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1123934084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1123934084, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1123934084|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 17:00:13,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-124033039 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-124033039 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-124033039 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-124033039 256) 0))) (or (and (= ~z$w_buff1_used~0_In-124033039 |ULTIMATE.start_main_#t~ite39_Out-124033039|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-124033039|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-124033039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-124033039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-124033039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-124033039} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-124033039, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-124033039|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-124033039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-124033039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-124033039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 17:00:13,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In588640368 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In588640368 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out588640368| ~z$r_buff0_thd0~0_In588640368)) (and (= |ULTIMATE.start_main_#t~ite40_Out588640368| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In588640368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588640368} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In588640368, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out588640368|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588640368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:00:13,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In301115488 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In301115488 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In301115488 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In301115488 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out301115488| ~z$r_buff1_thd0~0_In301115488) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out301115488| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In301115488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In301115488, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In301115488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301115488} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out301115488|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In301115488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In301115488, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In301115488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301115488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:00:13,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:00:13,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:00:13 BasicIcfg [2019-12-07 17:00:13,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:00:13,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:00:13,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:00:13,286 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:00:13,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:59:58" (3/4) ... [2019-12-07 17:00:13,288 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:00:13,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36|)) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1365~0.base_36| 4) |v_#length_27|) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36| 1) |v_#valid_83|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (= |v_#NULL.offset_5| 0) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= 0 |v_ULTIMATE.start_main_~#t1365~0.offset_23|) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1365~0.base_36|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36|) |v_ULTIMATE.start_main_~#t1365~0.offset_23| 0))) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_24|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ULTIMATE.start_main_~#t1365~0.offset=|v_ULTIMATE.start_main_~#t1365~0.offset_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ULTIMATE.start_main_~#t1365~0.base=|v_ULTIMATE.start_main_~#t1365~0.base_36|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_24|, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_17|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_37|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_~#t1366~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1365~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1365~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1366~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1368~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1367~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1368~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:00:13,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1366~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) |v_ULTIMATE.start_main_~#t1366~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1366~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1366~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_11|, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1366~0.base, ULTIMATE.start_main_~#t1366~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:00:13,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1367~0.offset_10| 0) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1367~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11|) |v_ULTIMATE.start_main_~#t1367~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1367~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1367~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1367~0.base] because there is no mapped edge [2019-12-07 17:00:13,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1368~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1368~0.base_13|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13|) |v_ULTIMATE.start_main_~#t1368~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1368~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t1368~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_13|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1368~0.base, ULTIMATE.start_main_~#t1368~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:00:13,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20)) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~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{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~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[~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] because there is no mapped edge [2019-12-07 17:00:13,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~a~0_44 1) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_51 1) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_23|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:00:13,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~x~0_33 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_15)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:00:13,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In844111362 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In844111362 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In844111362 |P3Thread1of1ForFork1_#t~ite28_Out844111362|)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out844111362| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In844111362, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In844111362} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In844111362, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out844111362|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In844111362} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:00:13,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In1333068116 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1333068116 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1333068116 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1333068116 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1333068116|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1333068116 |P3Thread1of1ForFork1_#t~ite29_Out1333068116|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1333068116, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333068116, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1333068116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333068116} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1333068116, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1333068116|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333068116, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1333068116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333068116} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 17:00:13,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1726324773 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1726324773 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-1726324773 ~z$r_buff0_thd4~0_In-1726324773))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-1726324773 0)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726324773, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1726324773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726324773, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1726324773, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1726324773|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:00:13,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1495303276 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1495303276 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1495303276 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1495303276 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite31_Out1495303276| ~z$r_buff1_thd4~0_In1495303276) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork1_#t~ite31_Out1495303276| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1495303276, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1495303276, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1495303276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495303276} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1495303276, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1495303276, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1495303276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495303276, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1495303276|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:00:13,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#t~ite31_60| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:00:13,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite23_31| |v_P2Thread1of1ForFork0_#t~ite23_30|) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_44|) (= |v_P2Thread1of1ForFork0_#t~ite22_29| |v_P2Thread1of1ForFork0_#t~ite22_28|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0))) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_29|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_13|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_28|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_30|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_44|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_29|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_27|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 17:00:13,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:00:13,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:00:13,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1442517328 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1442517328 256) 0))) (or (and (= ~z~0_In-1442517328 |ULTIMATE.start_main_#t~ite36_Out-1442517328|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1442517328 |ULTIMATE.start_main_#t~ite36_Out-1442517328|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1442517328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442517328, ~z$w_buff1~0=~z$w_buff1~0_In-1442517328, ~z~0=~z~0_In-1442517328} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1442517328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442517328, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1442517328|, ~z$w_buff1~0=~z$w_buff1~0_In-1442517328, ~z~0=~z~0_In-1442517328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 17:00:13,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 17:00:13,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1123934084 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1123934084 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1123934084| ~z$w_buff0_used~0_In-1123934084) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1123934084| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1123934084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1123934084} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1123934084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1123934084, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1123934084|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 17:00:13,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-124033039 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-124033039 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-124033039 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-124033039 256) 0))) (or (and (= ~z$w_buff1_used~0_In-124033039 |ULTIMATE.start_main_#t~ite39_Out-124033039|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-124033039|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-124033039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-124033039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-124033039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-124033039} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-124033039, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-124033039|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-124033039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-124033039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-124033039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 17:00:13,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In588640368 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In588640368 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out588640368| ~z$r_buff0_thd0~0_In588640368)) (and (= |ULTIMATE.start_main_#t~ite40_Out588640368| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In588640368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588640368} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In588640368, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out588640368|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588640368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:00:13,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In301115488 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In301115488 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In301115488 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In301115488 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out301115488| ~z$r_buff1_thd0~0_In301115488) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out301115488| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In301115488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In301115488, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In301115488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301115488} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out301115488|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In301115488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In301115488, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In301115488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301115488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:00:13,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:00:13,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_678ae04a-4d90-40b9-b5f1-6b9aa8e2da0c/bin/uautomizer/witness.graphml [2019-12-07 17:00:13,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:00:13,349 INFO L168 Benchmark]: Toolchain (without parser) took 16065.55 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 932.6 MB in the beginning and 1.4 GB in the end (delta: -494.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:00:13,349 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:13,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:13,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:13,350 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:13,350 INFO L168 Benchmark]: RCFGBuilder took 368.91 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: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:13,351 INFO L168 Benchmark]: TraceAbstraction took 15153.99 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -448.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 17:00:13,351 INFO L168 Benchmark]: Witness Printer took 62.12 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.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:00:13,352 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.28 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.91 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: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15153.99 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -448.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 62.12 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.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.2s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 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) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1971 SDtfs, 2655 SDslu, 3173 SDs, 0 SdLazy, 933 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41295occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 28393 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 69100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...