./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_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_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/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 c08162be2751b25887953e3769a6e7eb040df9f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:20:18,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:20:18,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:20:18,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:20:18,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:20:18,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:20:18,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:20:18,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:20:18,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:20:18,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:20:18,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:20:18,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:20:18,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:20:18,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:20:18,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:20:18,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:20:18,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:20:18,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:20:18,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:20:18,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:20:18,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:20:18,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:20:18,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:20:18,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:20:18,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:20:18,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:20:18,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:20:18,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:20:18,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:20:18,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:20:18,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:20:18,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:20:18,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:20:18,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:20:18,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:20:18,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:20:18,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:20:18,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:20:18,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:20:18,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:20:18,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:20:18,093 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:20:18,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:20:18,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:20:18,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:20:18,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:20:18,106 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:20:18,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:20:18,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:20:18,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:20:18,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:20:18,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:20:18,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:20:18,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:20:18,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:20:18,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:20:18,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:20:18,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:20:18,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:20:18,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:20:18,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:20:18,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:20:18,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:20:18,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:20:18,110 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_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/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 -> c08162be2751b25887953e3769a6e7eb040df9f5 [2019-12-07 10:20:18,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:20:18,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:20:18,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:20:18,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:20:18,237 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:20:18,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_pso.opt.i [2019-12-07 10:20:18,285 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/data/0f78e912d/c4ba79b7d9094ac59ee81544df108842/FLAG5a7e89f11 [2019-12-07 10:20:18,647 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:20:18,647 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/sv-benchmarks/c/pthread-wmm/mix000_pso.opt.i [2019-12-07 10:20:18,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/data/0f78e912d/c4ba79b7d9094ac59ee81544df108842/FLAG5a7e89f11 [2019-12-07 10:20:18,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/data/0f78e912d/c4ba79b7d9094ac59ee81544df108842 [2019-12-07 10:20:18,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:20:18,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:20:18,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:20:18,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:20:18,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:20:18,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:20:18" (1/1) ... [2019-12-07 10:20:18,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8e373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:18, skipping insertion in model container [2019-12-07 10:20:18,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:20:18" (1/1) ... [2019-12-07 10:20:18,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:20:18,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:20:18,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:20:18,954 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:20:18,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:20:19,039 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:20:19,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19 WrapperNode [2019-12-07 10:20:19,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:20:19,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:20:19,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:20:19,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:20:19,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:20:19,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:20:19,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:20:19,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:20:19,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... [2019-12-07 10:20:19,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:20:19,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:20:19,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:20:19,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:20:19,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/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 10:20:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:20:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:20:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:20:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:20:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:20:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:20:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:20:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:20:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:20:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:20:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:20:19,151 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 10:20:19,537 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:20:19,538 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:20:19,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:20:19 BoogieIcfgContainer [2019-12-07 10:20:19,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:20:19,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:20:19,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:20:19,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:20:19,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:20:18" (1/3) ... [2019-12-07 10:20:19,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328b89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:20:19, skipping insertion in model container [2019-12-07 10:20:19,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:20:19" (2/3) ... [2019-12-07 10:20:19,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328b89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:20:19, skipping insertion in model container [2019-12-07 10:20:19,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:20:19" (3/3) ... [2019-12-07 10:20:19,543 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_pso.opt.i [2019-12-07 10:20:19,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:20:19,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:20:19,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:20:19,555 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:20:19,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,593 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,593 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,593 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:20:19,616 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:20:19,628 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:20:19,628 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:20:19,628 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:20:19,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:20:19,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:20:19,629 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:20:19,629 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:20:19,629 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:20:19,639 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 10:20:19,640 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 10:20:19,699 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 10:20:19,699 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:20:19,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:20:19,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 10:20:19,764 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 10:20:19,764 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:20:19,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:20:19,790 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 10:20:19,791 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:20:22,600 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 10:20:22,772 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 10:20:22,886 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-12-07 10:20:22,887 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 10:20:22,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-12-07 10:20:24,014 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-12-07 10:20:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-12-07 10:20:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:20:24,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:24,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:20:24,020 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-12-07 10:20:24,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:24,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498145098] [2019-12-07 10:20:24,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:24,163 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 10:20:24,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498145098] [2019-12-07 10:20:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:24,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:20:24,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444063203] [2019-12-07 10:20:24,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:24,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:24,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:24,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:24,178 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-12-07 10:20:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:24,459 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-12-07 10:20:24,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:24,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:20:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:24,599 INFO L225 Difference]: With dead ends: 23438 [2019-12-07 10:20:24,599 INFO L226 Difference]: Without dead ends: 21828 [2019-12-07 10:20:24,600 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 10:20:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-12-07 10:20:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-12-07 10:20:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-12-07 10:20:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-12-07 10:20:25,475 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-12-07 10:20:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:25,475 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-12-07 10:20:25,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-12-07 10:20:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:20:25,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:25,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:25,478 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-12-07 10:20:25,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:25,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759157717] [2019-12-07 10:20:25,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:25,537 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 10:20:25,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759157717] [2019-12-07 10:20:25,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:25,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:25,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199103673] [2019-12-07 10:20:25,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:25,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:25,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:25,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:25,540 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-12-07 10:20:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:26,055 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-12-07 10:20:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:26,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:20:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:26,283 INFO L225 Difference]: With dead ends: 34804 [2019-12-07 10:20:26,283 INFO L226 Difference]: Without dead ends: 34788 [2019-12-07 10:20:26,284 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 10:20:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-07 10:20:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-12-07 10:20:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-12-07 10:20:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-12-07 10:20:27,111 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-12-07 10:20:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:27,112 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-12-07 10:20:27,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-12-07 10:20:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:20:27,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:27,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:27,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-12-07 10:20:27,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:27,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175605128] [2019-12-07 10:20:27,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:27,261 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 10:20:27,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175605128] [2019-12-07 10:20:27,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:27,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:27,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463137020] [2019-12-07 10:20:27,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:27,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:27,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:27,262 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 4 states. [2019-12-07 10:20:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:27,552 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-12-07 10:20:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:27,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:20:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:27,633 INFO L225 Difference]: With dead ends: 44062 [2019-12-07 10:20:27,633 INFO L226 Difference]: Without dead ends: 44047 [2019-12-07 10:20:27,634 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 10:20:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-12-07 10:20:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-12-07 10:20:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-12-07 10:20:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-12-07 10:20:28,578 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-12-07 10:20:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:28,579 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-12-07 10:20:28,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-12-07 10:20:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:20:28,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:28,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:28,582 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-12-07 10:20:28,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:28,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381902984] [2019-12-07 10:20:28,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:20:28,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381902984] [2019-12-07 10:20:28,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:28,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:28,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834550636] [2019-12-07 10:20:28,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:28,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:28,610 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 3 states. [2019-12-07 10:20:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:28,853 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-12-07 10:20:28,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:28,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:20:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:28,961 INFO L225 Difference]: With dead ends: 64200 [2019-12-07 10:20:28,961 INFO L226 Difference]: Without dead ends: 64200 [2019-12-07 10:20:28,962 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 10:20:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-12-07 10:20:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-12-07 10:20:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-12-07 10:20:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-12-07 10:20:30,295 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-12-07 10:20:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:30,295 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-12-07 10:20:30,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-12-07 10:20:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:20:30,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:30,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:30,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-12-07 10:20:30,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:30,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948551821] [2019-12-07 10:20:30,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:30,344 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 10:20:30,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948551821] [2019-12-07 10:20:30,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:30,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:30,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559065943] [2019-12-07 10:20:30,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:30,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:30,345 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 4 states. [2019-12-07 10:20:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:30,388 INFO L93 Difference]: Finished difference Result 9360 states and 25413 transitions. [2019-12-07 10:20:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:20:30,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:20:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:30,393 INFO L225 Difference]: With dead ends: 9360 [2019-12-07 10:20:30,394 INFO L226 Difference]: Without dead ends: 5784 [2019-12-07 10:20:30,394 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 10:20:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2019-12-07 10:20:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5784. [2019-12-07 10:20:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-12-07 10:20:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 13603 transitions. [2019-12-07 10:20:30,447 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 13603 transitions. Word has length 16 [2019-12-07 10:20:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:30,447 INFO L462 AbstractCegarLoop]: Abstraction has 5784 states and 13603 transitions. [2019-12-07 10:20:30,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 13603 transitions. [2019-12-07 10:20:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:20:30,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:30,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:30,448 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-12-07 10:20:30,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:30,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472847256] [2019-12-07 10:20:30,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:30,489 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 10:20:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472847256] [2019-12-07 10:20:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229800708] [2019-12-07 10:20:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:30,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:30,490 INFO L87 Difference]: Start difference. First operand 5784 states and 13603 transitions. Second operand 4 states. [2019-12-07 10:20:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:30,674 INFO L93 Difference]: Finished difference Result 7282 states and 16815 transitions. [2019-12-07 10:20:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:30,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 10:20:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:30,679 INFO L225 Difference]: With dead ends: 7282 [2019-12-07 10:20:30,679 INFO L226 Difference]: Without dead ends: 7254 [2019-12-07 10:20:30,679 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 10:20:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-12-07 10:20:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5763. [2019-12-07 10:20:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2019-12-07 10:20:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 13545 transitions. [2019-12-07 10:20:30,735 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 13545 transitions. Word has length 17 [2019-12-07 10:20:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:30,736 INFO L462 AbstractCegarLoop]: Abstraction has 5763 states and 13545 transitions. [2019-12-07 10:20:30,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 13545 transitions. [2019-12-07 10:20:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:20:30,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:30,739 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] [2019-12-07 10:20:30,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1652760743, now seen corresponding path program 1 times [2019-12-07 10:20:30,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383997327] [2019-12-07 10:20:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:20:30,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383997327] [2019-12-07 10:20:30,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:30,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:30,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877179428] [2019-12-07 10:20:30,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:20:30,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:30,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:20:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:30,783 INFO L87 Difference]: Start difference. First operand 5763 states and 13545 transitions. Second operand 5 states. [2019-12-07 10:20:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:31,041 INFO L93 Difference]: Finished difference Result 7869 states and 17987 transitions. [2019-12-07 10:20:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:20:31,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:20:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:31,050 INFO L225 Difference]: With dead ends: 7869 [2019-12-07 10:20:31,050 INFO L226 Difference]: Without dead ends: 7868 [2019-12-07 10:20:31,051 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 10:20:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-12-07 10:20:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7238. [2019-12-07 10:20:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-07 10:20:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 16736 transitions. [2019-12-07 10:20:31,132 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 16736 transitions. Word has length 28 [2019-12-07 10:20:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:31,132 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 16736 transitions. [2019-12-07 10:20:31,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:20:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 16736 transitions. [2019-12-07 10:20:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:20:31,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:31,137 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 10:20:31,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-12-07 10:20:31,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:31,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889622919] [2019-12-07 10:20:31,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:31,161 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 10:20:31,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889622919] [2019-12-07 10:20:31,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:31,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:31,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814845477] [2019-12-07 10:20:31,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:31,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:31,162 INFO L87 Difference]: Start difference. First operand 7238 states and 16736 transitions. Second operand 3 states. [2019-12-07 10:20:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:31,214 INFO L93 Difference]: Finished difference Result 7743 states and 16952 transitions. [2019-12-07 10:20:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:31,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 10:20:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:31,220 INFO L225 Difference]: With dead ends: 7743 [2019-12-07 10:20:31,220 INFO L226 Difference]: Without dead ends: 7743 [2019-12-07 10:20:31,220 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 10:20:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7743 states. [2019-12-07 10:20:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7743 to 7211. [2019-12-07 10:20:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-12-07 10:20:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 15844 transitions. [2019-12-07 10:20:31,291 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 15844 transitions. Word has length 31 [2019-12-07 10:20:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:31,291 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 15844 transitions. [2019-12-07 10:20:31,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 15844 transitions. [2019-12-07 10:20:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:20:31,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:31,296 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 10:20:31,296 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 525279466, now seen corresponding path program 1 times [2019-12-07 10:20:31,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:31,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095516753] [2019-12-07 10:20:31,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:31,334 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 10:20:31,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095516753] [2019-12-07 10:20:31,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:31,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:20:31,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97767545] [2019-12-07 10:20:31,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:31,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:31,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:31,336 INFO L87 Difference]: Start difference. First operand 7211 states and 15844 transitions. Second operand 3 states. [2019-12-07 10:20:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:31,356 INFO L93 Difference]: Finished difference Result 7105 states and 15616 transitions. [2019-12-07 10:20:31,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:31,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 10:20:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:31,362 INFO L225 Difference]: With dead ends: 7105 [2019-12-07 10:20:31,362 INFO L226 Difference]: Without dead ends: 7105 [2019-12-07 10:20:31,362 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 10:20:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7105 states. [2019-12-07 10:20:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7105 to 7105. [2019-12-07 10:20:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-12-07 10:20:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 15616 transitions. [2019-12-07 10:20:31,430 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 15616 transitions. Word has length 33 [2019-12-07 10:20:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:31,430 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 15616 transitions. [2019-12-07 10:20:31,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 15616 transitions. [2019-12-07 10:20:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:20:31,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:31,435 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] [2019-12-07 10:20:31,435 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1333269799, now seen corresponding path program 1 times [2019-12-07 10:20:31,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:31,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510364490] [2019-12-07 10:20:31,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:31,481 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 10:20:31,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510364490] [2019-12-07 10:20:31,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:31,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:31,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589079144] [2019-12-07 10:20:31,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:20:31,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:20:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:31,483 INFO L87 Difference]: Start difference. First operand 7105 states and 15616 transitions. Second operand 5 states. [2019-12-07 10:20:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:31,721 INFO L93 Difference]: Finished difference Result 7988 states and 17297 transitions. [2019-12-07 10:20:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:20:31,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:20:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:31,727 INFO L225 Difference]: With dead ends: 7988 [2019-12-07 10:20:31,727 INFO L226 Difference]: Without dead ends: 7987 [2019-12-07 10:20:31,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 10:20:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2019-12-07 10:20:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 6266. [2019-12-07 10:20:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6266 states. [2019-12-07 10:20:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 13920 transitions. [2019-12-07 10:20:31,793 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 13920 transitions. Word has length 34 [2019-12-07 10:20:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:31,794 INFO L462 AbstractCegarLoop]: Abstraction has 6266 states and 13920 transitions. [2019-12-07 10:20:31,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:20:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 13920 transitions. [2019-12-07 10:20:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:20:31,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:31,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:31,799 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash 135630366, now seen corresponding path program 1 times [2019-12-07 10:20:31,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:31,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478180617] [2019-12-07 10:20:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:31,864 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 10:20:31,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478180617] [2019-12-07 10:20:31,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:31,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:20:31,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037424666] [2019-12-07 10:20:31,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:20:31,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:20:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:31,865 INFO L87 Difference]: Start difference. First operand 6266 states and 13920 transitions. Second operand 5 states. [2019-12-07 10:20:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:32,145 INFO L93 Difference]: Finished difference Result 7418 states and 16257 transitions. [2019-12-07 10:20:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:20:32,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 10:20:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:32,151 INFO L225 Difference]: With dead ends: 7418 [2019-12-07 10:20:32,151 INFO L226 Difference]: Without dead ends: 7418 [2019-12-07 10:20:32,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:20:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-12-07 10:20:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 7084. [2019-12-07 10:20:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7084 states. [2019-12-07 10:20:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 15609 transitions. [2019-12-07 10:20:32,220 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 15609 transitions. Word has length 41 [2019-12-07 10:20:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:32,220 INFO L462 AbstractCegarLoop]: Abstraction has 7084 states and 15609 transitions. [2019-12-07 10:20:32,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:20:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 15609 transitions. [2019-12-07 10:20:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:20:32,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:32,226 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] [2019-12-07 10:20:32,226 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash -73517057, now seen corresponding path program 1 times [2019-12-07 10:20:32,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:32,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238709940] [2019-12-07 10:20:32,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:32,289 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 10:20:32,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238709940] [2019-12-07 10:20:32,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:32,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:20:32,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449544033] [2019-12-07 10:20:32,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:20:32,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:20:32,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:20:32,290 INFO L87 Difference]: Start difference. First operand 7084 states and 15609 transitions. Second operand 5 states. [2019-12-07 10:20:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:32,329 INFO L93 Difference]: Finished difference Result 4816 states and 10495 transitions. [2019-12-07 10:20:32,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:32,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 10:20:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:32,333 INFO L225 Difference]: With dead ends: 4816 [2019-12-07 10:20:32,333 INFO L226 Difference]: Without dead ends: 4523 [2019-12-07 10:20:32,333 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 10:20:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2019-12-07 10:20:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 4204. [2019-12-07 10:20:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4204 states. [2019-12-07 10:20:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 9289 transitions. [2019-12-07 10:20:32,374 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 9289 transitions. Word has length 42 [2019-12-07 10:20:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:32,375 INFO L462 AbstractCegarLoop]: Abstraction has 4204 states and 9289 transitions. [2019-12-07 10:20:32,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:20:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 9289 transitions. [2019-12-07 10:20:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:20:32,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:32,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:32,380 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1172304105, now seen corresponding path program 1 times [2019-12-07 10:20:32,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:32,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638001274] [2019-12-07 10:20:32,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:32,433 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 10:20:32,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638001274] [2019-12-07 10:20:32,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:32,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:20:32,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418331219] [2019-12-07 10:20:32,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:20:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:20:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:20:32,435 INFO L87 Difference]: Start difference. First operand 4204 states and 9289 transitions. Second operand 3 states. [2019-12-07 10:20:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:32,453 INFO L93 Difference]: Finished difference Result 4204 states and 9288 transitions. [2019-12-07 10:20:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:20:32,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 10:20:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:32,458 INFO L225 Difference]: With dead ends: 4204 [2019-12-07 10:20:32,458 INFO L226 Difference]: Without dead ends: 4204 [2019-12-07 10:20:32,459 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 10:20:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2019-12-07 10:20:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 4009. [2019-12-07 10:20:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2019-12-07 10:20:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 8923 transitions. [2019-12-07 10:20:32,508 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 8923 transitions. Word has length 58 [2019-12-07 10:20:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:32,508 INFO L462 AbstractCegarLoop]: Abstraction has 4009 states and 8923 transitions. [2019-12-07 10:20:32,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:20:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 8923 transitions. [2019-12-07 10:20:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:20:32,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:32,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:32,514 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 879996346, now seen corresponding path program 1 times [2019-12-07 10:20:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:32,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370742297] [2019-12-07 10:20:32,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:32,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 10:20:32,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370742297] [2019-12-07 10:20:32,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:32,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:20:32,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778599394] [2019-12-07 10:20:32,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:20:32,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:20:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:20:32,576 INFO L87 Difference]: Start difference. First operand 4009 states and 8923 transitions. Second operand 4 states. [2019-12-07 10:20:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:32,597 INFO L93 Difference]: Finished difference Result 4673 states and 10310 transitions. [2019-12-07 10:20:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:20:32,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 10:20:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:32,598 INFO L225 Difference]: With dead ends: 4673 [2019-12-07 10:20:32,599 INFO L226 Difference]: Without dead ends: 730 [2019-12-07 10:20:32,599 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 10:20:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-07 10:20:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-12-07 10:20:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-12-07 10:20:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1480 transitions. [2019-12-07 10:20:32,607 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1480 transitions. Word has length 59 [2019-12-07 10:20:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:32,607 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1480 transitions. [2019-12-07 10:20:32,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:20:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1480 transitions. [2019-12-07 10:20:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:20:32,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:32,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:32,609 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1149563698, now seen corresponding path program 2 times [2019-12-07 10:20:32,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:32,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266063649] [2019-12-07 10:20:32,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:32,703 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 10:20:32,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266063649] [2019-12-07 10:20:32,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:32,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:20:32,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983616087] [2019-12-07 10:20:32,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:20:32,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:20:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:20:32,704 INFO L87 Difference]: Start difference. First operand 730 states and 1480 transitions. Second operand 8 states. [2019-12-07 10:20:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:32,867 INFO L93 Difference]: Finished difference Result 1352 states and 2718 transitions. [2019-12-07 10:20:32,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:20:32,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-07 10:20:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:32,868 INFO L225 Difference]: With dead ends: 1352 [2019-12-07 10:20:32,868 INFO L226 Difference]: Without dead ends: 970 [2019-12-07 10:20:32,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:20:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-12-07 10:20:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 784. [2019-12-07 10:20:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 10:20:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1571 transitions. [2019-12-07 10:20:32,875 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1571 transitions. Word has length 59 [2019-12-07 10:20:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:32,875 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1571 transitions. [2019-12-07 10:20:32,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:20:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1571 transitions. [2019-12-07 10:20:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:20:32,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:32,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:32,876 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 83110094, now seen corresponding path program 3 times [2019-12-07 10:20:32,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:32,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559091648] [2019-12-07 10:20:32,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:20:32,954 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 10:20:32,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559091648] [2019-12-07 10:20:32,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:20:32,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:20:32,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707853964] [2019-12-07 10:20:32,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:20:32,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:20:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:20:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:20:32,956 INFO L87 Difference]: Start difference. First operand 784 states and 1571 transitions. Second operand 6 states. [2019-12-07 10:20:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:20:33,004 INFO L93 Difference]: Finished difference Result 1557 states and 3130 transitions. [2019-12-07 10:20:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:20:33,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 10:20:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:20:33,005 INFO L225 Difference]: With dead ends: 1557 [2019-12-07 10:20:33,005 INFO L226 Difference]: Without dead ends: 783 [2019-12-07 10:20:33,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:20:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-12-07 10:20:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2019-12-07 10:20:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 10:20:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1569 transitions. [2019-12-07 10:20:33,012 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1569 transitions. Word has length 59 [2019-12-07 10:20:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:20:33,012 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1569 transitions. [2019-12-07 10:20:33,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:20:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1569 transitions. [2019-12-07 10:20:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:20:33,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:20:33,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:20:33,013 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:20:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:20:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 1 times [2019-12-07 10:20:33,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:20:33,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413575871] [2019-12-07 10:20:33,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:20:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:20:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:20:33,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:20:33,080 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:20:33,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= |v_ULTIMATE.start_main_~#t4~0.offset_24| 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t4~0.base_34|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t4~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t4~0.base_34| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t4~0.base_34|)) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t4~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t4~0.base_34|) |v_ULTIMATE.start_main_~#t4~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd1~0_297 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ULTIMATE.start_main_~#t5~0.base=|v_ULTIMATE.start_main_~#t5~0.base_23|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t5~0.offset=|v_ULTIMATE.start_main_~#t5~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_34|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_24|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t5~0.base, ~y~0, ULTIMATE.start_main_~#t5~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t4~0.base, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t4~0.offset, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:20:33,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (not (= |v_ULTIMATE.start_main_~#t5~0.base_12| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t5~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t5~0.base_12|) |v_ULTIMATE.start_main_~#t5~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t5~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t5~0.offset_10| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t5~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t5~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t5~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t5~0.offset=|v_ULTIMATE.start_main_~#t5~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t5~0.base=|v_ULTIMATE.start_main_~#t5~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t5~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t5~0.base] because there is no mapped edge [2019-12-07 10:20:33,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 10:20:33,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-509733616 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-509733616 256)))) (or (and (= ~x$w_buff0~0_In-509733616 |P1Thread1of1ForFork1_#t~ite28_Out-509733616|) (not .cse0) (not .cse1)) (and (= ~x$w_buff1~0_In-509733616 |P1Thread1of1ForFork1_#t~ite28_Out-509733616|) (or .cse0 .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-509733616, ~x$w_buff1~0=~x$w_buff1~0_In-509733616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-509733616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509733616} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-509733616, ~x$w_buff1~0=~x$w_buff1~0_In-509733616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-509733616, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-509733616|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509733616} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:20:33,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:20:33,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:20:33,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In708216972 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out708216972| ~x$mem_tmp~0_In708216972) (not .cse0)) (and (= ~x~0_In708216972 |P1Thread1of1ForFork1_#t~ite48_Out708216972|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In708216972, ~x$mem_tmp~0=~x$mem_tmp~0_In708216972, ~x~0=~x~0_In708216972} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In708216972, ~x$mem_tmp~0=~x$mem_tmp~0_In708216972, ~x~0=~x~0_In708216972, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out708216972|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:20:33,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1187289414 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1187289414 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-1187289414| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1187289414 |P1Thread1of1ForFork1_#t~ite51_Out-1187289414|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1187289414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1187289414} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1187289414|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1187289414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1187289414} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:20:33,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1583190072 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1583190072 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1583190072 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1583190072 256) 0))) (or (and (= ~x$w_buff1_used~0_In1583190072 |P1Thread1of1ForFork1_#t~ite52_Out1583190072|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite52_Out1583190072| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1583190072, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1583190072, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1583190072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583190072} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1583190072|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583190072, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1583190072, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1583190072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583190072} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:20:33,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-482643378 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_Out-482643378 ~x$r_buff0_thd2~0_In-482643378)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-482643378 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~x$r_buff0_thd2~0_Out-482643378 0)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-482643378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482643378} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-482643378|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-482643378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482643378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:20:33,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1990196730 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1990196730 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1990196730 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1990196730 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite54_Out1990196730| ~x$r_buff1_thd2~0_In1990196730)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite54_Out1990196730| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1990196730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1990196730, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1990196730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990196730} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1990196730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1990196730, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1990196730|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1990196730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990196730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:20:33,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:20:33,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-2096815648 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-2096815648| ~x$mem_tmp~0_In-2096815648)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-2096815648| ~x~0_In-2096815648)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-2096815648, ~x$mem_tmp~0=~x$mem_tmp~0_In-2096815648, ~x~0=~x~0_In-2096815648} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-2096815648|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2096815648, ~x$mem_tmp~0=~x$mem_tmp~0_In-2096815648, ~x~0=~x~0_In-2096815648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:20:33,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:20:33,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:20:33,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite58_Out251150021| |ULTIMATE.start_main_#t~ite57_Out251150021|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In251150021 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In251150021 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out251150021| ~x$w_buff1~0_In251150021) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= |ULTIMATE.start_main_#t~ite57_Out251150021| ~x~0_In251150021) (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In251150021, ~x$w_buff1_used~0=~x$w_buff1_used~0_In251150021, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In251150021, ~x~0=~x~0_In251150021} OutVars{~x$w_buff1~0=~x$w_buff1~0_In251150021, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out251150021|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out251150021|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In251150021, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In251150021, ~x~0=~x~0_In251150021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:20:33,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1331163155 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1331163155 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1331163155| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out1331163155| ~x$w_buff0_used~0_In1331163155) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1331163155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331163155} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1331163155, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1331163155|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331163155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:20:33,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In418672586 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In418672586 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In418672586 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In418672586 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out418672586|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In418672586 |ULTIMATE.start_main_#t~ite60_Out418672586|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418672586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418672586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418672586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418672586} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418672586, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out418672586|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418672586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418672586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418672586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:20:33,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1932812088 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1932812088 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1932812088|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1932812088 |ULTIMATE.start_main_#t~ite61_Out-1932812088|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1932812088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932812088} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1932812088, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1932812088|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932812088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:20:33,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In924292444 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In924292444 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In924292444 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In924292444 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out924292444|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In924292444 |ULTIMATE.start_main_#t~ite62_Out924292444|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In924292444, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924292444, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In924292444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924292444} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out924292444|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In924292444, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924292444, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In924292444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924292444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:20:33,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:20:33,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:20:33 BasicIcfg [2019-12-07 10:20:33,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:20:33,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:20:33,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:20:33,151 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:20:33,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:20:19" (3/4) ... [2019-12-07 10:20:33,153 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:20:33,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= |v_ULTIMATE.start_main_~#t4~0.offset_24| 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t4~0.base_34|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t4~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t4~0.base_34| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t4~0.base_34|)) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t4~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t4~0.base_34|) |v_ULTIMATE.start_main_~#t4~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd1~0_297 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ULTIMATE.start_main_~#t5~0.base=|v_ULTIMATE.start_main_~#t5~0.base_23|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t5~0.offset=|v_ULTIMATE.start_main_~#t5~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_34|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_24|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t5~0.base, ~y~0, ULTIMATE.start_main_~#t5~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t4~0.base, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t4~0.offset, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:20:33,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (not (= |v_ULTIMATE.start_main_~#t5~0.base_12| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t5~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t5~0.base_12|) |v_ULTIMATE.start_main_~#t5~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t5~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t5~0.offset_10| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t5~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t5~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t5~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t5~0.offset=|v_ULTIMATE.start_main_~#t5~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t5~0.base=|v_ULTIMATE.start_main_~#t5~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t5~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t5~0.base] because there is no mapped edge [2019-12-07 10:20:33,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 10:20:33,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-509733616 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-509733616 256)))) (or (and (= ~x$w_buff0~0_In-509733616 |P1Thread1of1ForFork1_#t~ite28_Out-509733616|) (not .cse0) (not .cse1)) (and (= ~x$w_buff1~0_In-509733616 |P1Thread1of1ForFork1_#t~ite28_Out-509733616|) (or .cse0 .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-509733616, ~x$w_buff1~0=~x$w_buff1~0_In-509733616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-509733616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509733616} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-509733616, ~x$w_buff1~0=~x$w_buff1~0_In-509733616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-509733616, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-509733616|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509733616} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:20:33,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:20:33,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:20:33,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In708216972 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out708216972| ~x$mem_tmp~0_In708216972) (not .cse0)) (and (= ~x~0_In708216972 |P1Thread1of1ForFork1_#t~ite48_Out708216972|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In708216972, ~x$mem_tmp~0=~x$mem_tmp~0_In708216972, ~x~0=~x~0_In708216972} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In708216972, ~x$mem_tmp~0=~x$mem_tmp~0_In708216972, ~x~0=~x~0_In708216972, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out708216972|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:20:33,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1187289414 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1187289414 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-1187289414| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1187289414 |P1Thread1of1ForFork1_#t~ite51_Out-1187289414|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1187289414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1187289414} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1187289414|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1187289414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1187289414} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:20:33,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1583190072 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1583190072 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1583190072 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1583190072 256) 0))) (or (and (= ~x$w_buff1_used~0_In1583190072 |P1Thread1of1ForFork1_#t~ite52_Out1583190072|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite52_Out1583190072| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1583190072, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1583190072, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1583190072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583190072} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1583190072|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583190072, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1583190072, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1583190072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583190072} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:20:33,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-482643378 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_Out-482643378 ~x$r_buff0_thd2~0_In-482643378)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-482643378 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~x$r_buff0_thd2~0_Out-482643378 0)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-482643378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482643378} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-482643378|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-482643378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482643378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:20:33,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1990196730 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1990196730 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1990196730 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1990196730 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite54_Out1990196730| ~x$r_buff1_thd2~0_In1990196730)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite54_Out1990196730| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1990196730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1990196730, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1990196730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990196730} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1990196730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1990196730, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1990196730|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1990196730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990196730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:20:33,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:20:33,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-2096815648 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-2096815648| ~x$mem_tmp~0_In-2096815648)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-2096815648| ~x~0_In-2096815648)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-2096815648, ~x$mem_tmp~0=~x$mem_tmp~0_In-2096815648, ~x~0=~x~0_In-2096815648} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-2096815648|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2096815648, ~x$mem_tmp~0=~x$mem_tmp~0_In-2096815648, ~x~0=~x~0_In-2096815648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:20:33,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 10:20:33,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:20:33,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite58_Out251150021| |ULTIMATE.start_main_#t~ite57_Out251150021|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In251150021 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In251150021 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out251150021| ~x$w_buff1~0_In251150021) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= |ULTIMATE.start_main_#t~ite57_Out251150021| ~x~0_In251150021) (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In251150021, ~x$w_buff1_used~0=~x$w_buff1_used~0_In251150021, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In251150021, ~x~0=~x~0_In251150021} OutVars{~x$w_buff1~0=~x$w_buff1~0_In251150021, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out251150021|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out251150021|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In251150021, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In251150021, ~x~0=~x~0_In251150021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:20:33,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1331163155 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1331163155 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1331163155| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out1331163155| ~x$w_buff0_used~0_In1331163155) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1331163155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331163155} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1331163155, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1331163155|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1331163155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:20:33,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In418672586 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In418672586 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In418672586 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In418672586 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out418672586|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In418672586 |ULTIMATE.start_main_#t~ite60_Out418672586|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418672586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418672586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418672586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418672586} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418672586, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out418672586|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418672586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418672586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418672586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:20:33,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1932812088 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1932812088 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1932812088|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1932812088 |ULTIMATE.start_main_#t~ite61_Out-1932812088|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1932812088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932812088} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1932812088, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1932812088|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1932812088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:20:33,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In924292444 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In924292444 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In924292444 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In924292444 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out924292444|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In924292444 |ULTIMATE.start_main_#t~ite62_Out924292444|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In924292444, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924292444, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In924292444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924292444} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out924292444|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In924292444, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924292444, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In924292444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924292444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:20:33,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:20:33,223 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2f8a98bd-d4e6-4580-a824-2383c5cfaacb/bin/uautomizer/witness.graphml [2019-12-07 10:20:33,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:20:33,224 INFO L168 Benchmark]: Toolchain (without parser) took 14554.00 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 937.2 MB in the beginning and 1.6 GB in the end (delta: -617.7 MB). Peak memory consumption was 386.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:33,224 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:20:33,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:33,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:20:33,225 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:33,225 INFO L168 Benchmark]: RCFGBuilder took 434.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:33,225 INFO L168 Benchmark]: TraceAbstraction took 13611.48 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 901.8 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -576.4 MB). Peak memory consumption was 325.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:33,226 INFO L168 Benchmark]: Witness Printer took 72.13 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:20:33,227 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 434.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13611.48 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 901.8 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -576.4 MB). Peak memory consumption was 325.3 MB. Max. memory is 11.5 GB. * Witness Printer took 72.13 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t4, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t5, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3089 SDtfs, 2824 SDslu, 4720 SDs, 0 SdLazy, 1822 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57180occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 18077 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 82628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...