./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/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 8f2d48c0072e6644ba6f943ccec98c56855dec7d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:48:45,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:48:45,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:48:45,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:48:45,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:48:45,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:48:45,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:48:45,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:48:45,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:48:45,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:48:45,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:48:45,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:48:45,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:48:45,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:48:45,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:48:45,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:48:45,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:48:45,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:48:45,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:48:45,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:48:45,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:48:45,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:48:45,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:48:45,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:48:45,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:48:45,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:48:45,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:48:45,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:48:45,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:48:45,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:48:45,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:48:45,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:48:45,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:48:45,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:48:45,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:48:45,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:48:45,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:48:45,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:48:45,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:48:45,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:48:45,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:48:45,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:48:45,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:48:45,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:48:45,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:48:45,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:48:45,683 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:48:45,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:48:45,684 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:48:45,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:48:45,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:48:45,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:48:45,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:48:45,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:48:45,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:48:45,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:48:45,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:48:45,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:48:45,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:48:45,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:48:45,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:48:45,686 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:48:45,686 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_7b569384-98c6-433e-9af6-a516ffede9f0/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 -> 8f2d48c0072e6644ba6f943ccec98c56855dec7d [2019-12-07 14:48:45,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:48:45,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:48:45,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:48:45,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:48:45,809 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:48:45,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i [2019-12-07 14:48:45,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/data/888d99d18/a15e9e5a3095474ab89a029f2d40d6c7/FLAGb74cc47b7 [2019-12-07 14:48:46,276 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:48:46,277 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i [2019-12-07 14:48:46,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/data/888d99d18/a15e9e5a3095474ab89a029f2d40d6c7/FLAGb74cc47b7 [2019-12-07 14:48:46,635 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/data/888d99d18/a15e9e5a3095474ab89a029f2d40d6c7 [2019-12-07 14:48:46,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:48:46,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:48:46,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:48:46,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:48:46,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:48:46,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:48:46" (1/1) ... [2019-12-07 14:48:46,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:46, skipping insertion in model container [2019-12-07 14:48:46,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:48:46" (1/1) ... [2019-12-07 14:48:46,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:48:46,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:48:46,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:48:46,939 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:48:46,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:48:47,026 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:48:47,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47 WrapperNode [2019-12-07 14:48:47,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:48:47,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:48:47,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:48:47,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:48:47,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:48:47,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:48:47,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:48:47,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:48:47,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... [2019-12-07 14:48:47,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:48:47,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:48:47,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:48:47,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:48:47,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:48:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:48:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:48:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:48:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:48:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:48:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:48:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:48:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:48:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:48:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:48:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:48:47,135 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:48:47,478 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:48:47,478 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:48:47,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:48:47 BoogieIcfgContainer [2019-12-07 14:48:47,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:48:47,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:48:47,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:48:47,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:48:47,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:48:46" (1/3) ... [2019-12-07 14:48:47,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5fbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:48:47, skipping insertion in model container [2019-12-07 14:48:47,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:48:47" (2/3) ... [2019-12-07 14:48:47,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5fbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:48:47, skipping insertion in model container [2019-12-07 14:48:47,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:48:47" (3/3) ... [2019-12-07 14:48:47,483 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-12-07 14:48:47,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:48:47,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:48:47,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:48:47,495 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:48:47,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:48:47,544 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:48:47,556 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:48:47,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:48:47,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:48:47,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:48:47,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:48:47,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:48:47,557 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:48:47,557 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:48:47,567 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-07 14:48:47,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 14:48:47,617 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 14:48:47,617 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:48:47,625 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 14:48:47,636 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 14:48:47,662 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 14:48:47,662 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:48:47,665 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 14:48:47,676 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 14:48:47,677 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:48:50,416 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 14:48:50,643 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-07 14:48:50,643 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-07 14:48:50,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-07 14:48:51,003 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-07 14:48:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-07 14:48:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:48:51,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:51,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:48:51,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-07 14:48:51,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:51,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168510848] [2019-12-07 14:48:51,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:51,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168510848] [2019-12-07 14:48:51,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:51,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:48:51,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886470471] [2019-12-07 14:48:51,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:48:51,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:48:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:51,175 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-07 14:48:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:51,377 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-07 14:48:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:48:51,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:48:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:51,441 INFO L225 Difference]: With dead ends: 8598 [2019-12-07 14:48:51,441 INFO L226 Difference]: Without dead ends: 7662 [2019-12-07 14:48:51,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-07 14:48:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-07 14:48:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-07 14:48:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-07 14:48:51,719 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-07 14:48:51,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:51,720 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-07 14:48:51,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:48:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-07 14:48:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:48:51,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:51,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:51,723 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-07 14:48:51,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:51,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509779852] [2019-12-07 14:48:51,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:51,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509779852] [2019-12-07 14:48:51,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:51,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:48:51,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853794958] [2019-12-07 14:48:51,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:48:51,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:51,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:48:51,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:51,781 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-07 14:48:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:51,799 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-07 14:48:51,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:48:51,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 14:48:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:51,805 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 14:48:51,805 INFO L226 Difference]: Without dead ends: 1232 [2019-12-07 14:48:51,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-07 14:48:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-07 14:48:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-07 14:48:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-07 14:48:51,826 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-07 14:48:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:51,827 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-07 14:48:51,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:48:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-07 14:48:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:48:51,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:51,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:51,828 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-07 14:48:51,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:51,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260664375] [2019-12-07 14:48:51,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:51,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260664375] [2019-12-07 14:48:51,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:51,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:48:51,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841084155] [2019-12-07 14:48:51,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:48:51,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:51,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:48:51,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:51,867 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-07 14:48:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:51,915 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-07 14:48:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:48:51,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:48:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:51,924 INFO L225 Difference]: With dead ends: 1943 [2019-12-07 14:48:51,924 INFO L226 Difference]: Without dead ends: 1943 [2019-12-07 14:48:51,925 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 14:48:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-07 14:48:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-07 14:48:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-07 14:48:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-07 14:48:51,970 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-07 14:48:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:51,971 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-07 14:48:51,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:48:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-07 14:48:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:48:51,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:51,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:51,972 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-07 14:48:51,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:51,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462911938] [2019-12-07 14:48:51,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:52,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462911938] [2019-12-07 14:48:52,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:52,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:48:52,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826209762] [2019-12-07 14:48:52,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:48:52,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:48:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:48:52,029 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-07 14:48:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:52,172 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-07 14:48:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:48:52,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:48:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:52,183 INFO L225 Difference]: With dead ends: 1724 [2019-12-07 14:48:52,183 INFO L226 Difference]: Without dead ends: 1724 [2019-12-07 14:48:52,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:48:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-07 14:48:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-07 14:48:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-07 14:48:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-07 14:48:52,223 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-07 14:48:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:52,223 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-07 14:48:52,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:48:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-07 14:48:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:48:52,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:52,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:52,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-07 14:48:52,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:52,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626910984] [2019-12-07 14:48:52,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:52,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626910984] [2019-12-07 14:48:52,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:52,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:48:52,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987347708] [2019-12-07 14:48:52,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:48:52,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:48:52,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:48:52,268 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-07 14:48:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:52,374 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-07 14:48:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:48:52,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:48:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:52,383 INFO L225 Difference]: With dead ends: 1991 [2019-12-07 14:48:52,383 INFO L226 Difference]: Without dead ends: 1991 [2019-12-07 14:48:52,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:48:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-07 14:48:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-07 14:48:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-07 14:48:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-07 14:48:52,413 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-07 14:48:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:52,413 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-07 14:48:52,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:48:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-07 14:48:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:48:52,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:52,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:52,415 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-07 14:48:52,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:52,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818975699] [2019-12-07 14:48:52,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:52,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818975699] [2019-12-07 14:48:52,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:52,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:48:52,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34866511] [2019-12-07 14:48:52,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:48:52,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:48:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:48:52,497 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-07 14:48:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:52,654 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-07 14:48:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:48:52,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 14:48:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:52,664 INFO L225 Difference]: With dead ends: 2258 [2019-12-07 14:48:52,664 INFO L226 Difference]: Without dead ends: 2258 [2019-12-07 14:48:52,665 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 14:48:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-07 14:48:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-07 14:48:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-07 14:48:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-07 14:48:52,701 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-07 14:48:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:52,702 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-07 14:48:52,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:48:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-07 14:48:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:48:52,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:52,704 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] [2019-12-07 14:48:52,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-07 14:48:52,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:52,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530475617] [2019-12-07 14:48:52,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:52,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530475617] [2019-12-07 14:48:52,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:52,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:48:52,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647054359] [2019-12-07 14:48:52,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:48:52,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:48:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:52,757 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-07 14:48:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:52,773 INFO L93 Difference]: Finished difference Result 1931 states and 4282 transitions. [2019-12-07 14:48:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:48:52,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 14:48:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:52,779 INFO L225 Difference]: With dead ends: 1931 [2019-12-07 14:48:52,779 INFO L226 Difference]: Without dead ends: 1931 [2019-12-07 14:48:52,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2019-12-07 14:48:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1700. [2019-12-07 14:48:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-12-07 14:48:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 3811 transitions. [2019-12-07 14:48:52,802 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 3811 transitions. Word has length 26 [2019-12-07 14:48:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:52,803 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 3811 transitions. [2019-12-07 14:48:52,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:48:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 3811 transitions. [2019-12-07 14:48:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:48:52,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:52,804 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] [2019-12-07 14:48:52,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-07 14:48:52,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:52,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967602199] [2019-12-07 14:48:52,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:52,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967602199] [2019-12-07 14:48:52,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:52,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:48:52,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654184509] [2019-12-07 14:48:52,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:48:52,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:48:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:48:52,863 INFO L87 Difference]: Start difference. First operand 1700 states and 3811 transitions. Second operand 5 states. [2019-12-07 14:48:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:52,910 INFO L93 Difference]: Finished difference Result 1798 states and 4002 transitions. [2019-12-07 14:48:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:48:52,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:48:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:52,915 INFO L225 Difference]: With dead ends: 1798 [2019-12-07 14:48:52,915 INFO L226 Difference]: Without dead ends: 1798 [2019-12-07 14:48:52,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:48:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-12-07 14:48:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1798. [2019-12-07 14:48:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-12-07 14:48:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 4002 transitions. [2019-12-07 14:48:52,939 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 4002 transitions. Word has length 26 [2019-12-07 14:48:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 1798 states and 4002 transitions. [2019-12-07 14:48:52,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:48:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 4002 transitions. [2019-12-07 14:48:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:48:52,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:52,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:52,942 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 461323697, now seen corresponding path program 1 times [2019-12-07 14:48:52,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:52,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181213704] [2019-12-07 14:48:52,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:53,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181213704] [2019-12-07 14:48:53,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:53,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:48:53,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352421534] [2019-12-07 14:48:53,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:48:53,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:48:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:48:53,005 INFO L87 Difference]: Start difference. First operand 1798 states and 4002 transitions. Second operand 4 states. [2019-12-07 14:48:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:53,023 INFO L93 Difference]: Finished difference Result 1797 states and 4000 transitions. [2019-12-07 14:48:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:48:53,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 14:48:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:53,027 INFO L225 Difference]: With dead ends: 1797 [2019-12-07 14:48:53,027 INFO L226 Difference]: Without dead ends: 1797 [2019-12-07 14:48:53,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:48:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-12-07 14:48:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1797. [2019-12-07 14:48:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2019-12-07 14:48:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 4000 transitions. [2019-12-07 14:48:53,049 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 4000 transitions. Word has length 27 [2019-12-07 14:48:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:53,050 INFO L462 AbstractCegarLoop]: Abstraction has 1797 states and 4000 transitions. [2019-12-07 14:48:53,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:48:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 4000 transitions. [2019-12-07 14:48:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:48:53,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:53,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:48:53,052 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-12-07 14:48:53,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:53,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488989380] [2019-12-07 14:48:53,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:53,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488989380] [2019-12-07 14:48:53,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:53,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:48:53,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84300926] [2019-12-07 14:48:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:48:53,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:48:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:48:53,135 INFO L87 Difference]: Start difference. First operand 1797 states and 4000 transitions. Second operand 5 states. [2019-12-07 14:48:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:53,302 INFO L93 Difference]: Finished difference Result 2252 states and 4880 transitions. [2019-12-07 14:48:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:48:53,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 14:48:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:53,305 INFO L225 Difference]: With dead ends: 2252 [2019-12-07 14:48:53,305 INFO L226 Difference]: Without dead ends: 2252 [2019-12-07 14:48:53,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 14:48:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-12-07 14:48:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1743. [2019-12-07 14:48:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2019-12-07 14:48:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 3892 transitions. [2019-12-07 14:48:53,333 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 3892 transitions. Word has length 27 [2019-12-07 14:48:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:53,333 INFO L462 AbstractCegarLoop]: Abstraction has 1743 states and 3892 transitions. [2019-12-07 14:48:53,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:48:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 3892 transitions. [2019-12-07 14:48:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:48:53,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:53,335 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 14:48:53,336 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-07 14:48:53,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:53,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010769169] [2019-12-07 14:48:53,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:53,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010769169] [2019-12-07 14:48:53,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:53,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:48:53,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156725533] [2019-12-07 14:48:53,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:48:53,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:48:53,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:48:53,371 INFO L87 Difference]: Start difference. First operand 1743 states and 3892 transitions. Second operand 4 states. [2019-12-07 14:48:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:53,382 INFO L93 Difference]: Finished difference Result 847 states and 1873 transitions. [2019-12-07 14:48:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:48:53,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 14:48:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:53,384 INFO L225 Difference]: With dead ends: 847 [2019-12-07 14:48:53,384 INFO L226 Difference]: Without dead ends: 847 [2019-12-07 14:48:53,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:48:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-07 14:48:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2019-12-07 14:48:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-07 14:48:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1873 transitions. [2019-12-07 14:48:53,397 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1873 transitions. Word has length 28 [2019-12-07 14:48:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:53,398 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1873 transitions. [2019-12-07 14:48:53,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:48:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1873 transitions. [2019-12-07 14:48:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:48:53,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:53,399 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] [2019-12-07 14:48:53,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1237801842, now seen corresponding path program 1 times [2019-12-07 14:48:53,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:53,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265114881] [2019-12-07 14:48:53,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:53,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265114881] [2019-12-07 14:48:53,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:53,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:48:53,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647317947] [2019-12-07 14:48:53,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:48:53,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:48:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:53,439 INFO L87 Difference]: Start difference. First operand 847 states and 1873 transitions. Second operand 3 states. [2019-12-07 14:48:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:53,481 INFO L93 Difference]: Finished difference Result 1019 states and 2216 transitions. [2019-12-07 14:48:53,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:48:53,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 14:48:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:53,484 INFO L225 Difference]: With dead ends: 1019 [2019-12-07 14:48:53,484 INFO L226 Difference]: Without dead ends: 1019 [2019-12-07 14:48:53,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:48:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-07 14:48:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 845. [2019-12-07 14:48:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-07 14:48:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1863 transitions. [2019-12-07 14:48:53,512 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1863 transitions. Word has length 51 [2019-12-07 14:48:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:53,513 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1863 transitions. [2019-12-07 14:48:53,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:48:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1863 transitions. [2019-12-07 14:48:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:48:53,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:53,515 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] [2019-12-07 14:48:53,516 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:53,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:53,516 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-12-07 14:48:53,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:53,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982025586] [2019-12-07 14:48:53,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:48:53,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982025586] [2019-12-07 14:48:53,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:53,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:48:53,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108361118] [2019-12-07 14:48:53,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:48:53,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:48:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:48:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:48:53,603 INFO L87 Difference]: Start difference. First operand 845 states and 1863 transitions. Second operand 7 states. [2019-12-07 14:48:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:48:53,803 INFO L93 Difference]: Finished difference Result 2554 states and 5519 transitions. [2019-12-07 14:48:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:48:53,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 14:48:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:48:53,809 INFO L225 Difference]: With dead ends: 2554 [2019-12-07 14:48:53,809 INFO L226 Difference]: Without dead ends: 1768 [2019-12-07 14:48:53,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:48:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2019-12-07 14:48:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 965. [2019-12-07 14:48:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-12-07 14:48:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2121 transitions. [2019-12-07 14:48:53,832 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 2121 transitions. Word has length 52 [2019-12-07 14:48:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:48:53,832 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 2121 transitions. [2019-12-07 14:48:53,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:48:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 2121 transitions. [2019-12-07 14:48:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:48:53,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:48:53,835 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] [2019-12-07 14:48:53,835 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:48:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:48:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-12-07 14:48:53,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:48:53,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753903247] [2019-12-07 14:48:53,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:48:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:48:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:48:53,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:48:53,921 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:48:53,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= (select .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35|) 0) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35|) |v_ULTIMATE.start_main_~#t897~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t897~0.base_35|) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t897~0.base_35| 4)) (= |v_ULTIMATE.start_main_~#t897~0.offset_24| 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t897~0.offset=|v_ULTIMATE.start_main_~#t897~0.offset_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t897~0.base=|v_ULTIMATE.start_main_~#t897~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t898~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t897~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t897~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 14:48:53,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13|) |v_ULTIMATE.start_main_~#t898~0.offset_11| 1))) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t898~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t898~0.base_13|) (= |v_ULTIMATE.start_main_~#t898~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t898~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.base, ULTIMATE.start_main_~#t898~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 14:48:53,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out1494589977) (= ~z$w_buff1~0_Out1494589977 ~z$w_buff0~0_In1494589977) (= |P0Thread1of1ForFork0_#in~arg.offset_In1494589977| P0Thread1of1ForFork0_~arg.offset_Out1494589977) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1494589977| (ite (not (and (not (= (mod ~z$w_buff1_used~0_Out1494589977 256) 0)) (not (= (mod ~z$w_buff0_used~0_Out1494589977 256) 0)))) 1 0)) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1494589977 0)) (= P0Thread1of1ForFork0_~arg.base_Out1494589977 |P0Thread1of1ForFork0_#in~arg.base_In1494589977|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1494589977| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1494589977) (= 1 ~z$w_buff0~0_Out1494589977) (= ~z$w_buff1_used~0_Out1494589977 ~z$w_buff0_used~0_In1494589977)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1494589977|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494589977, ~z$w_buff0~0=~z$w_buff0~0_In1494589977, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1494589977|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1494589977|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1494589977, ~z$w_buff0~0=~z$w_buff0~0_Out1494589977, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1494589977, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1494589977, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1494589977|, ~z$w_buff1~0=~z$w_buff1~0_Out1494589977, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1494589977, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1494589977|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1494589977} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 14:48:53,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1427480410 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out1427480410| |P1Thread1of1ForFork1_#t~ite23_Out1427480410|) (= ~z$w_buff1_used~0_In1427480410 |P1Thread1of1ForFork1_#t~ite23_Out1427480410|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1427480410 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1427480410 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In1427480410 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In1427480410 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1427480410| ~z$w_buff1_used~0_In1427480410) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1427480410| |P1Thread1of1ForFork1_#t~ite23_Out1427480410|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1427480410, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1427480410, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1427480410, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1427480410|, ~weak$$choice2~0=~weak$$choice2~0_In1427480410, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1427480410} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1427480410, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1427480410, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1427480410|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1427480410, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1427480410|, ~weak$$choice2~0=~weak$$choice2~0_In1427480410, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1427480410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 14:48:53,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:48:53,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 14:48:53,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1670327778 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1670327778 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1670327778 |P0Thread1of1ForFork0_#t~ite5_Out1670327778|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1670327778|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1670327778, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1670327778} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1670327778|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1670327778, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1670327778} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:48:53,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1624207113 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1624207113 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1624207113 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1624207113 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1624207113 |P0Thread1of1ForFork0_#t~ite6_Out1624207113|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1624207113|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1624207113, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1624207113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1624207113, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1624207113} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1624207113|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1624207113, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1624207113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1624207113, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1624207113} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:48:53,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-254431539 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-254431539 256) 0)) (.cse1 (= ~z$r_buff0_thd1~0_In-254431539 ~z$r_buff0_thd1~0_Out-254431539))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-254431539)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-254431539, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-254431539} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-254431539, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-254431539|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-254431539} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:48:53,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1675398814 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1675398814 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1675398814 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1675398814 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1675398814|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1675398814 |P0Thread1of1ForFork0_#t~ite8_Out1675398814|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1675398814, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1675398814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675398814, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1675398814} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1675398814, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1675398814|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1675398814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675398814, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1675398814} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:48:53,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1767297540 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1767297540 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1767297540| |P1Thread1of1ForFork1_#t~ite32_Out-1767297540|))) (or (and .cse0 (= ~z~0_In-1767297540 |P1Thread1of1ForFork1_#t~ite32_Out-1767297540|) (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In-1767297540 |P1Thread1of1ForFork1_#t~ite32_Out-1767297540|) (not .cse1) (not .cse2) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1767297540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1767297540, ~z$w_buff1~0=~z$w_buff1~0_In-1767297540, ~z~0=~z~0_In-1767297540} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1767297540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1767297540, ~z$w_buff1~0=~z$w_buff1~0_In-1767297540, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1767297540|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1767297540|, ~z~0=~z~0_In-1767297540} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 14:48:53,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1035188243 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1035188243 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1035188243 |P1Thread1of1ForFork1_#t~ite34_Out-1035188243|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1035188243| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1035188243, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1035188243} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1035188243, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1035188243|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1035188243} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:48:53,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2011940242 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2011940242 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In2011940242 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2011940242 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out2011940242| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out2011940242| ~z$w_buff1_used~0_In2011940242)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2011940242, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2011940242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011940242, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2011940242} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2011940242, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2011940242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011940242, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2011940242|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2011940242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:48:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1415620701 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1415620701 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1415620701 |P1Thread1of1ForFork1_#t~ite36_Out1415620701|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1415620701|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1415620701, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1415620701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1415620701, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1415620701, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1415620701|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:48:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-13620548 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-13620548 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-13620548 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-13620548 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-13620548|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-13620548 |P1Thread1of1ForFork1_#t~ite37_Out-13620548|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-13620548, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-13620548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-13620548, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-13620548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-13620548, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-13620548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-13620548, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-13620548, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-13620548|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:48:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:48:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:48:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:48:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In347215976 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In347215976 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out347215976| ~z$w_buff1~0_In347215976) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out347215976| ~z~0_In347215976) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In347215976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In347215976, ~z$w_buff1~0=~z$w_buff1~0_In347215976, ~z~0=~z~0_In347215976} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out347215976|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In347215976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In347215976, ~z$w_buff1~0=~z$w_buff1~0_In347215976, ~z~0=~z~0_In347215976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:48:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 14:48:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In76431766 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In76431766 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out76431766| ~z$w_buff0_used~0_In76431766)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out76431766| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76431766, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76431766} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76431766, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76431766, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out76431766|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:48:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-834561444 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-834561444 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-834561444 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-834561444 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-834561444| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-834561444| ~z$w_buff1_used~0_In-834561444)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-834561444, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-834561444, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-834561444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-834561444} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-834561444, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-834561444, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-834561444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-834561444, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-834561444|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:48:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-573095295 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-573095295 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-573095295| ~z$r_buff0_thd0~0_In-573095295) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-573095295| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-573095295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573095295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-573095295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573095295, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-573095295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:48:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-443553675 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-443553675 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-443553675 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-443553675 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-443553675|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-443553675 |ULTIMATE.start_main_#t~ite45_Out-443553675|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-443553675, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-443553675, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-443553675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-443553675} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-443553675, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-443553675, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-443553675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-443553675, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-443553675|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:48:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:48:53,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:48:53 BasicIcfg [2019-12-07 14:48:53,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:48:53,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:48:53,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:48:53,973 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:48:53,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:48:47" (3/4) ... [2019-12-07 14:48:53,975 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:48:53,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= (select .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35|) 0) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35|) |v_ULTIMATE.start_main_~#t897~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t897~0.base_35|) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t897~0.base_35| 4)) (= |v_ULTIMATE.start_main_~#t897~0.offset_24| 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t897~0.offset=|v_ULTIMATE.start_main_~#t897~0.offset_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t897~0.base=|v_ULTIMATE.start_main_~#t897~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t898~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t897~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t897~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 14:48:53,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13|) |v_ULTIMATE.start_main_~#t898~0.offset_11| 1))) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t898~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t898~0.base_13|) (= |v_ULTIMATE.start_main_~#t898~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t898~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.base, ULTIMATE.start_main_~#t898~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 14:48:53,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out1494589977) (= ~z$w_buff1~0_Out1494589977 ~z$w_buff0~0_In1494589977) (= |P0Thread1of1ForFork0_#in~arg.offset_In1494589977| P0Thread1of1ForFork0_~arg.offset_Out1494589977) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1494589977| (ite (not (and (not (= (mod ~z$w_buff1_used~0_Out1494589977 256) 0)) (not (= (mod ~z$w_buff0_used~0_Out1494589977 256) 0)))) 1 0)) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1494589977 0)) (= P0Thread1of1ForFork0_~arg.base_Out1494589977 |P0Thread1of1ForFork0_#in~arg.base_In1494589977|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1494589977| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1494589977) (= 1 ~z$w_buff0~0_Out1494589977) (= ~z$w_buff1_used~0_Out1494589977 ~z$w_buff0_used~0_In1494589977)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1494589977|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494589977, ~z$w_buff0~0=~z$w_buff0~0_In1494589977, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1494589977|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1494589977|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1494589977, ~z$w_buff0~0=~z$w_buff0~0_Out1494589977, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1494589977, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1494589977, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1494589977|, ~z$w_buff1~0=~z$w_buff1~0_Out1494589977, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1494589977, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1494589977|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1494589977} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 14:48:53,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1427480410 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out1427480410| |P1Thread1of1ForFork1_#t~ite23_Out1427480410|) (= ~z$w_buff1_used~0_In1427480410 |P1Thread1of1ForFork1_#t~ite23_Out1427480410|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1427480410 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1427480410 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In1427480410 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In1427480410 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1427480410| ~z$w_buff1_used~0_In1427480410) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1427480410| |P1Thread1of1ForFork1_#t~ite23_Out1427480410|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1427480410, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1427480410, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1427480410, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1427480410|, ~weak$$choice2~0=~weak$$choice2~0_In1427480410, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1427480410} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1427480410, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1427480410, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1427480410|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1427480410, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1427480410|, ~weak$$choice2~0=~weak$$choice2~0_In1427480410, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1427480410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 14:48:53,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:48:53,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 14:48:53,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1670327778 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1670327778 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1670327778 |P0Thread1of1ForFork0_#t~ite5_Out1670327778|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1670327778|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1670327778, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1670327778} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1670327778|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1670327778, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1670327778} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:48:53,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1624207113 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1624207113 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1624207113 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1624207113 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1624207113 |P0Thread1of1ForFork0_#t~ite6_Out1624207113|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1624207113|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1624207113, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1624207113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1624207113, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1624207113} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1624207113|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1624207113, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1624207113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1624207113, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1624207113} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:48:53,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-254431539 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-254431539 256) 0)) (.cse1 (= ~z$r_buff0_thd1~0_In-254431539 ~z$r_buff0_thd1~0_Out-254431539))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-254431539)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-254431539, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-254431539} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-254431539, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-254431539|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-254431539} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:48:53,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1675398814 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1675398814 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1675398814 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1675398814 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1675398814|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1675398814 |P0Thread1of1ForFork0_#t~ite8_Out1675398814|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1675398814, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1675398814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675398814, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1675398814} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1675398814, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1675398814|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1675398814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675398814, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1675398814} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:48:53,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1767297540 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1767297540 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1767297540| |P1Thread1of1ForFork1_#t~ite32_Out-1767297540|))) (or (and .cse0 (= ~z~0_In-1767297540 |P1Thread1of1ForFork1_#t~ite32_Out-1767297540|) (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In-1767297540 |P1Thread1of1ForFork1_#t~ite32_Out-1767297540|) (not .cse1) (not .cse2) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1767297540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1767297540, ~z$w_buff1~0=~z$w_buff1~0_In-1767297540, ~z~0=~z~0_In-1767297540} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1767297540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1767297540, ~z$w_buff1~0=~z$w_buff1~0_In-1767297540, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1767297540|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1767297540|, ~z~0=~z~0_In-1767297540} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 14:48:53,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1035188243 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1035188243 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1035188243 |P1Thread1of1ForFork1_#t~ite34_Out-1035188243|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1035188243| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1035188243, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1035188243} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1035188243, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1035188243|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1035188243} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:48:53,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2011940242 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2011940242 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In2011940242 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2011940242 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out2011940242| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out2011940242| ~z$w_buff1_used~0_In2011940242)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2011940242, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2011940242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011940242, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2011940242} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2011940242, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2011940242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011940242, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2011940242|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2011940242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:48:53,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1415620701 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1415620701 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1415620701 |P1Thread1of1ForFork1_#t~ite36_Out1415620701|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1415620701|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1415620701, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1415620701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1415620701, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1415620701, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1415620701|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-13620548 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-13620548 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-13620548 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-13620548 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-13620548|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-13620548 |P1Thread1of1ForFork1_#t~ite37_Out-13620548|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-13620548, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-13620548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-13620548, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-13620548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-13620548, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-13620548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-13620548, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-13620548, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-13620548|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In347215976 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In347215976 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out347215976| ~z$w_buff1~0_In347215976) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out347215976| ~z~0_In347215976) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In347215976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In347215976, ~z$w_buff1~0=~z$w_buff1~0_In347215976, ~z~0=~z~0_In347215976} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out347215976|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In347215976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In347215976, ~z$w_buff1~0=~z$w_buff1~0_In347215976, ~z~0=~z~0_In347215976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 14:48:53,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In76431766 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In76431766 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out76431766| ~z$w_buff0_used~0_In76431766)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out76431766| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76431766, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76431766} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In76431766, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76431766, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out76431766|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:48:53,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-834561444 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-834561444 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-834561444 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-834561444 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-834561444| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-834561444| ~z$w_buff1_used~0_In-834561444)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-834561444, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-834561444, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-834561444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-834561444} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-834561444, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-834561444, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-834561444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-834561444, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-834561444|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:48:53,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-573095295 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-573095295 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-573095295| ~z$r_buff0_thd0~0_In-573095295) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-573095295| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-573095295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573095295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-573095295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573095295, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-573095295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:48:53,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-443553675 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-443553675 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-443553675 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-443553675 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-443553675|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-443553675 |ULTIMATE.start_main_#t~ite45_Out-443553675|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-443553675, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-443553675, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-443553675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-443553675} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-443553675, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-443553675, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-443553675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-443553675, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-443553675|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:48:53,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:48:54,033 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7b569384-98c6-433e-9af6-a516ffede9f0/bin/uautomizer/witness.graphml [2019-12-07 14:48:54,033 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:48:54,034 INFO L168 Benchmark]: Toolchain (without parser) took 7394.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -104.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:54,034 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:48:54,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -114.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:54,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.89 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:54,035 INFO L168 Benchmark]: Boogie Preprocessor took 23.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:48:54,035 INFO L168 Benchmark]: RCFGBuilder took 390.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:54,036 INFO L168 Benchmark]: TraceAbstraction took 6492.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 998.6 MB in the beginning and 1.1 GB in the end (delta: -64.2 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:54,036 INFO L168 Benchmark]: Witness Printer took 60.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:54,037 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -114.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.89 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 390.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6492.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 998.6 MB in the beginning and 1.1 GB in the end (delta: -64.2 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. * Witness Printer took 60.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 6.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1488 SDtfs, 1080 SDslu, 2773 SDs, 0 SdLazy, 955 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 2875 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 50962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...