./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c1f4b5c4 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0ad8f032ff12be1afa2818ff680df05f6b1cb629 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-c1f4b5c [2019-12-08 15:57:23,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 15:57:23,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 15:57:23,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 15:57:23,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 15:57:23,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 15:57:23,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 15:57:23,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 15:57:23,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 15:57:23,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 15:57:23,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 15:57:23,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 15:57:23,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 15:57:23,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 15:57:23,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 15:57:23,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 15:57:23,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 15:57:23,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 15:57:23,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 15:57:23,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 15:57:23,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 15:57:23,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 15:57:23,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 15:57:23,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 15:57:23,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 15:57:23,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 15:57:23,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 15:57:23,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 15:57:23,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 15:57:23,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 15:57:23,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 15:57:23,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 15:57:23,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 15:57:23,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 15:57:23,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 15:57:23,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 15:57:23,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 15:57:23,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 15:57:23,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 15:57:23,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 15:57:23,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 15:57:23,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-08 15:57:23,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 15:57:23,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 15:57:23,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 15:57:23,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 15:57:23,364 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 15:57:23,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 15:57:23,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 15:57:23,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 15:57:23,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 15:57:23,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 15:57:23,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-08 15:57:23,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 15:57:23,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-08 15:57:23,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 15:57:23,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-08 15:57:23,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 15:57:23,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-08 15:57:23,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 15:57:23,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 15:57:23,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 15:57:23,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 15:57:23,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 15:57:23,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 15:57:23,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 15:57:23,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-08 15:57:23,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 15:57:23,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 15:57:23,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-08 15:57:23,371 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 15:57:23,371 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0ad8f032ff12be1afa2818ff680df05f6b1cb629 [2019-12-08 15:57:23,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 15:57:23,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 15:57:23,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 15:57:23,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 15:57:23,708 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 15:57:23,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i [2019-12-08 15:57:23,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934f0370a/ece180f4fede41d39b763bfb79c4e428/FLAGac61ac543 [2019-12-08 15:57:24,368 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 15:57:24,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc.i [2019-12-08 15:57:24,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934f0370a/ece180f4fede41d39b763bfb79c4e428/FLAGac61ac543 [2019-12-08 15:57:24,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934f0370a/ece180f4fede41d39b763bfb79c4e428 [2019-12-08 15:57:24,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 15:57:24,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-08 15:57:24,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 15:57:24,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 15:57:24,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 15:57:24,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:57:24" (1/1) ... [2019-12-08 15:57:24,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dfb932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:24, skipping insertion in model container [2019-12-08 15:57:24,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:57:24" (1/1) ... [2019-12-08 15:57:24,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 15:57:24,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 15:57:25,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 15:57:25,283 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 15:57:25,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 15:57:25,443 INFO L208 MainTranslator]: Completed translation [2019-12-08 15:57:25,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25 WrapperNode [2019-12-08 15:57:25,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 15:57:25,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-08 15:57:25,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-08 15:57:25,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-08 15:57:25,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-08 15:57:25,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 15:57:25,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 15:57:25,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 15:57:25,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... [2019-12-08 15:57:25,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 15:57:25,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 15:57:25,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 15:57:25,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 15:57:25,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-08 15:57:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-08 15:57:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-08 15:57:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-08 15:57:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 15:57:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-08 15:57:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-08 15:57:25,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-08 15:57:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-08 15:57:25,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-08 15:57:25,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 15:57:25,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 15:57:25,696 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-08 15:57:26,898 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 15:57:26,899 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-08 15:57:26,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:57:26 BoogieIcfgContainer [2019-12-08 15:57:26,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 15:57:26,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 15:57:26,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 15:57:26,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 15:57:26,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:57:24" (1/3) ... [2019-12-08 15:57:26,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e0b5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:57:26, skipping insertion in model container [2019-12-08 15:57:26,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:57:25" (2/3) ... [2019-12-08 15:57:26,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e0b5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:57:26, skipping insertion in model container [2019-12-08 15:57:26,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:57:26" (3/3) ... [2019-12-08 15:57:26,915 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc.i [2019-12-08 15:57:26,927 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-08 15:57:26,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 15:57:26,941 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-08 15:57:26,942 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-08 15:57:27,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:57:27,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-08 15:57:27,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 15:57:27,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-08 15:57:27,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 15:57:27,196 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 15:57:27,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 15:57:27,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 15:57:27,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 15:57:27,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 15:57:27,223 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-08 15:57:27,226 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-08 15:57:27,372 INFO L130 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-08 15:57:27,372 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-08 15:57:27,413 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1198 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-08 15:57:27,494 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-08 15:57:27,581 INFO L130 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-08 15:57:27,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-08 15:57:27,608 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1198 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-08 15:57:27,676 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-08 15:57:27,678 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-08 15:57:34,251 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-08 15:57:34,365 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-08 15:57:34,480 INFO L206 etLargeBlockEncoding]: Checked pairs total: 232725 [2019-12-08 15:57:34,480 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-08 15:57:34,489 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 184 transitions [2019-12-08 15:57:39,123 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 50078 states. [2019-12-08 15:57:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states. [2019-12-08 15:57:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-08 15:57:39,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:39,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-08 15:57:39,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1268502306, now seen corresponding path program 1 times [2019-12-08 15:57:39,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:39,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972480454] [2019-12-08 15:57:39,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:57:39,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972480454] [2019-12-08 15:57:39,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:39,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-08 15:57:39,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639821044] [2019-12-08 15:57:39,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 15:57:39,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 15:57:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:57:39,527 INFO L87 Difference]: Start difference. First operand 50078 states. Second operand 3 states. [2019-12-08 15:57:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:40,294 INFO L93 Difference]: Finished difference Result 50030 states and 178645 transitions. [2019-12-08 15:57:40,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 15:57:40,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-08 15:57:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:40,633 INFO L225 Difference]: With dead ends: 50030 [2019-12-08 15:57:40,633 INFO L226 Difference]: Without dead ends: 49055 [2019-12-08 15:57:40,635 INFO L631 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-08 15:57:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49055 states. [2019-12-08 15:57:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49055 to 49055. [2019-12-08 15:57:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49055 states. [2019-12-08 15:57:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49055 states to 49055 states and 175395 transitions. [2019-12-08 15:57:43,352 INFO L78 Accepts]: Start accepts. Automaton has 49055 states and 175395 transitions. Word has length 5 [2019-12-08 15:57:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:43,352 INFO L462 AbstractCegarLoop]: Abstraction has 49055 states and 175395 transitions. [2019-12-08 15:57:43,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 15:57:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 49055 states and 175395 transitions. [2019-12-08 15:57:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-08 15:57:43,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:43,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:43,356 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1198055303, now seen corresponding path program 1 times [2019-12-08 15:57:43,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:43,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047198733] [2019-12-08 15:57:43,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:43,439 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-08 15:57:43,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047198733] [2019-12-08 15:57:43,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:43,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 15:57:43,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888815060] [2019-12-08 15:57:43,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 15:57:43,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:43,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 15:57:43,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:57:43,444 INFO L87 Difference]: Start difference. First operand 49055 states and 175395 transitions. Second operand 4 states. [2019-12-08 15:57:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:43,540 INFO L93 Difference]: Finished difference Result 6292 states and 16551 transitions. [2019-12-08 15:57:43,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 15:57:43,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-08 15:57:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:43,556 INFO L225 Difference]: With dead ends: 6292 [2019-12-08 15:57:43,556 INFO L226 Difference]: Without dead ends: 5317 [2019-12-08 15:57:43,557 INFO L631 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-08 15:57:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2019-12-08 15:57:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5317. [2019-12-08 15:57:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5317 states. [2019-12-08 15:57:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 13388 transitions. [2019-12-08 15:57:43,691 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 13388 transitions. Word has length 11 [2019-12-08 15:57:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:43,691 INFO L462 AbstractCegarLoop]: Abstraction has 5317 states and 13388 transitions. [2019-12-08 15:57:43,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 15:57:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 13388 transitions. [2019-12-08 15:57:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-08 15:57:43,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:43,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:43,693 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2038106739, now seen corresponding path program 1 times [2019-12-08 15:57:43,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:43,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682272902] [2019-12-08 15:57:43,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:43,768 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-08 15:57:43,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682272902] [2019-12-08 15:57:43,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:43,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-08 15:57:43,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231448514] [2019-12-08 15:57:43,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 15:57:43,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 15:57:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:57:43,770 INFO L87 Difference]: Start difference. First operand 5317 states and 13388 transitions. Second operand 4 states. [2019-12-08 15:57:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:44,382 INFO L93 Difference]: Finished difference Result 6650 states and 16215 transitions. [2019-12-08 15:57:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 15:57:44,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-08 15:57:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:44,402 INFO L225 Difference]: With dead ends: 6650 [2019-12-08 15:57:44,402 INFO L226 Difference]: Without dead ends: 6637 [2019-12-08 15:57:44,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:57:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2019-12-08 15:57:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6481. [2019-12-08 15:57:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6481 states. [2019-12-08 15:57:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 15900 transitions. [2019-12-08 15:57:44,813 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 15900 transitions. Word has length 11 [2019-12-08 15:57:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:44,814 INFO L462 AbstractCegarLoop]: Abstraction has 6481 states and 15900 transitions. [2019-12-08 15:57:44,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 15:57:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 15900 transitions. [2019-12-08 15:57:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-08 15:57:44,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:44,823 INFO L411 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] [2019-12-08 15:57:44,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 160503652, now seen corresponding path program 1 times [2019-12-08 15:57:44,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:44,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333595099] [2019-12-08 15:57:44,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:44,989 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-08 15:57:44,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333595099] [2019-12-08 15:57:44,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:44,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 15:57:44,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607022081] [2019-12-08 15:57:44,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:57:44,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:57:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:57:44,991 INFO L87 Difference]: Start difference. First operand 6481 states and 15900 transitions. Second operand 5 states. [2019-12-08 15:57:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:45,677 INFO L93 Difference]: Finished difference Result 8213 states and 19809 transitions. [2019-12-08 15:57:45,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 15:57:45,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-08 15:57:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:45,701 INFO L225 Difference]: With dead ends: 8213 [2019-12-08 15:57:45,701 INFO L226 Difference]: Without dead ends: 8213 [2019-12-08 15:57:45,702 INFO L631 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-08 15:57:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8213 states. [2019-12-08 15:57:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8213 to 7980. [2019-12-08 15:57:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-08 15:57:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 19357 transitions. [2019-12-08 15:57:45,853 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 19357 transitions. Word has length 23 [2019-12-08 15:57:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:45,854 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 19357 transitions. [2019-12-08 15:57:45,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:57:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 19357 transitions. [2019-12-08 15:57:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-08 15:57:45,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:45,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:45,860 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash 551296721, now seen corresponding path program 1 times [2019-12-08 15:57:45,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:45,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906703203] [2019-12-08 15:57:45,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:45,960 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-08 15:57:45,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906703203] [2019-12-08 15:57:45,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:45,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-08 15:57:45,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541866989] [2019-12-08 15:57:45,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:57:45,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:57:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:57:45,963 INFO L87 Difference]: Start difference. First operand 7980 states and 19357 transitions. Second operand 5 states. [2019-12-08 15:57:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:46,010 INFO L93 Difference]: Finished difference Result 1856 states and 4027 transitions. [2019-12-08 15:57:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 15:57:46,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-08 15:57:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:46,015 INFO L225 Difference]: With dead ends: 1856 [2019-12-08 15:57:46,016 INFO L226 Difference]: Without dead ends: 1686 [2019-12-08 15:57:46,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:57:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2019-12-08 15:57:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1616. [2019-12-08 15:57:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2019-12-08 15:57:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 3523 transitions. [2019-12-08 15:57:46,045 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 3523 transitions. Word has length 37 [2019-12-08 15:57:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:46,045 INFO L462 AbstractCegarLoop]: Abstraction has 1616 states and 3523 transitions. [2019-12-08 15:57:46,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:57:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 3523 transitions. [2019-12-08 15:57:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:46,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:46,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:46,052 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -175598507, now seen corresponding path program 1 times [2019-12-08 15:57:46,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:46,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769619582] [2019-12-08 15:57:46,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:46,273 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-08 15:57:46,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769619582] [2019-12-08 15:57:46,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:46,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 15:57:46,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665317100] [2019-12-08 15:57:46,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 15:57:46,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 15:57:46,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:57:46,276 INFO L87 Difference]: Start difference. First operand 1616 states and 3523 transitions. Second operand 7 states. [2019-12-08 15:57:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:47,359 INFO L93 Difference]: Finished difference Result 2441 states and 5258 transitions. [2019-12-08 15:57:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 15:57:47,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-08 15:57:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:47,364 INFO L225 Difference]: With dead ends: 2441 [2019-12-08 15:57:47,364 INFO L226 Difference]: Without dead ends: 2441 [2019-12-08 15:57:47,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-08 15:57:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-12-08 15:57:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1898. [2019-12-08 15:57:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-12-08 15:57:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4144 transitions. [2019-12-08 15:57:47,396 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4144 transitions. Word has length 83 [2019-12-08 15:57:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:47,397 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 4144 transitions. [2019-12-08 15:57:47,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 15:57:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4144 transitions. [2019-12-08 15:57:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:47,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:47,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:47,402 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1827081641, now seen corresponding path program 2 times [2019-12-08 15:57:47,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:47,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222990625] [2019-12-08 15:57:47,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:47,530 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-08 15:57:47,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222990625] [2019-12-08 15:57:47,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:47,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 15:57:47,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039441349] [2019-12-08 15:57:47,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 15:57:47,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 15:57:47,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:57:47,533 INFO L87 Difference]: Start difference. First operand 1898 states and 4144 transitions. Second operand 6 states. [2019-12-08 15:57:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:48,453 INFO L93 Difference]: Finished difference Result 2323 states and 5011 transitions. [2019-12-08 15:57:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 15:57:48,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-08 15:57:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:48,460 INFO L225 Difference]: With dead ends: 2323 [2019-12-08 15:57:48,461 INFO L226 Difference]: Without dead ends: 2323 [2019-12-08 15:57:48,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-08 15:57:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-12-08 15:57:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2003. [2019-12-08 15:57:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-12-08 15:57:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 4360 transitions. [2019-12-08 15:57:48,496 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 4360 transitions. Word has length 83 [2019-12-08 15:57:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:48,498 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 4360 transitions. [2019-12-08 15:57:48,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 15:57:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 4360 transitions. [2019-12-08 15:57:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:48,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:48,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:48,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 219474423, now seen corresponding path program 3 times [2019-12-08 15:57:48,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:48,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964568789] [2019-12-08 15:57:48,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:48,675 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-08 15:57:48,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964568789] [2019-12-08 15:57:48,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:48,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 15:57:48,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069271578] [2019-12-08 15:57:48,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:57:48,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:57:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:57:48,677 INFO L87 Difference]: Start difference. First operand 2003 states and 4360 transitions. Second operand 5 states. [2019-12-08 15:57:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:48,994 INFO L93 Difference]: Finished difference Result 2156 states and 4640 transitions. [2019-12-08 15:57:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 15:57:48,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-08 15:57:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:48,998 INFO L225 Difference]: With dead ends: 2156 [2019-12-08 15:57:48,998 INFO L226 Difference]: Without dead ends: 2156 [2019-12-08 15:57:48,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:57:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-12-08 15:57:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2045. [2019-12-08 15:57:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-08 15:57:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4445 transitions. [2019-12-08 15:57:49,025 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4445 transitions. Word has length 83 [2019-12-08 15:57:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:49,026 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4445 transitions. [2019-12-08 15:57:49,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:57:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4445 transitions. [2019-12-08 15:57:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:49,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:49,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:49,031 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1940404291, now seen corresponding path program 4 times [2019-12-08 15:57:49,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:49,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008112695] [2019-12-08 15:57:49,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:57:49,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008112695] [2019-12-08 15:57:49,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:49,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-08 15:57:49,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642776917] [2019-12-08 15:57:49,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-08 15:57:49,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-08 15:57:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-08 15:57:49,300 INFO L87 Difference]: Start difference. First operand 2045 states and 4445 transitions. Second operand 10 states. [2019-12-08 15:57:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:50,621 INFO L93 Difference]: Finished difference Result 3563 states and 7629 transitions. [2019-12-08 15:57:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-08 15:57:50,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-08 15:57:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:50,626 INFO L225 Difference]: With dead ends: 3563 [2019-12-08 15:57:50,626 INFO L226 Difference]: Without dead ends: 3563 [2019-12-08 15:57:50,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-08 15:57:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-12-08 15:57:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2337. [2019-12-08 15:57:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-08 15:57:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 5075 transitions. [2019-12-08 15:57:50,667 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 5075 transitions. Word has length 83 [2019-12-08 15:57:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:50,667 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 5075 transitions. [2019-12-08 15:57:50,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-08 15:57:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 5075 transitions. [2019-12-08 15:57:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:50,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:50,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:50,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 22757597, now seen corresponding path program 5 times [2019-12-08 15:57:50,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:50,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965598972] [2019-12-08 15:57:50,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:50,825 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-08 15:57:50,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965598972] [2019-12-08 15:57:50,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:50,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 15:57:50,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796064899] [2019-12-08 15:57:50,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 15:57:50,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 15:57:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:57:50,828 INFO L87 Difference]: Start difference. First operand 2337 states and 5075 transitions. Second operand 7 states. [2019-12-08 15:57:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:51,810 INFO L93 Difference]: Finished difference Result 4515 states and 9687 transitions. [2019-12-08 15:57:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 15:57:51,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-08 15:57:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:51,816 INFO L225 Difference]: With dead ends: 4515 [2019-12-08 15:57:51,816 INFO L226 Difference]: Without dead ends: 4515 [2019-12-08 15:57:51,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-08 15:57:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2019-12-08 15:57:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2472. [2019-12-08 15:57:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-08 15:57:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 5399 transitions. [2019-12-08 15:57:51,858 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 5399 transitions. Word has length 83 [2019-12-08 15:57:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:51,858 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 5399 transitions. [2019-12-08 15:57:51,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 15:57:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 5399 transitions. [2019-12-08 15:57:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:51,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:51,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:51,865 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 617305587, now seen corresponding path program 6 times [2019-12-08 15:57:51,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:51,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389199005] [2019-12-08 15:57:51,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:52,017 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-08 15:57:52,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389199005] [2019-12-08 15:57:52,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:52,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 15:57:52,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562208834] [2019-12-08 15:57:52,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 15:57:52,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 15:57:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:57:52,020 INFO L87 Difference]: Start difference. First operand 2472 states and 5399 transitions. Second operand 7 states. [2019-12-08 15:57:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:53,060 INFO L93 Difference]: Finished difference Result 4559 states and 9873 transitions. [2019-12-08 15:57:53,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-08 15:57:53,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-08 15:57:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:53,068 INFO L225 Difference]: With dead ends: 4559 [2019-12-08 15:57:53,068 INFO L226 Difference]: Without dead ends: 4559 [2019-12-08 15:57:53,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-08 15:57:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2019-12-08 15:57:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 2443. [2019-12-08 15:57:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2019-12-08 15:57:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 5341 transitions. [2019-12-08 15:57:53,138 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 5341 transitions. Word has length 83 [2019-12-08 15:57:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:53,138 INFO L462 AbstractCegarLoop]: Abstraction has 2443 states and 5341 transitions. [2019-12-08 15:57:53,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 15:57:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 5341 transitions. [2019-12-08 15:57:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:53,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:53,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:53,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1177358919, now seen corresponding path program 7 times [2019-12-08 15:57:53,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:53,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303683428] [2019-12-08 15:57:53,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:53,363 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-08 15:57:53,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303683428] [2019-12-08 15:57:53,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:53,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 15:57:53,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224341605] [2019-12-08 15:57:53,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 15:57:53,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 15:57:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:57:53,367 INFO L87 Difference]: Start difference. First operand 2443 states and 5341 transitions. Second operand 7 states. [2019-12-08 15:57:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:54,304 INFO L93 Difference]: Finished difference Result 3107 states and 6640 transitions. [2019-12-08 15:57:54,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 15:57:54,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-08 15:57:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:54,309 INFO L225 Difference]: With dead ends: 3107 [2019-12-08 15:57:54,309 INFO L226 Difference]: Without dead ends: 3107 [2019-12-08 15:57:54,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-08 15:57:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2019-12-08 15:57:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2449. [2019-12-08 15:57:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2449 states. [2019-12-08 15:57:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 5352 transitions. [2019-12-08 15:57:54,332 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 5352 transitions. Word has length 83 [2019-12-08 15:57:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:54,332 INFO L462 AbstractCegarLoop]: Abstraction has 2449 states and 5352 transitions. [2019-12-08 15:57:54,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 15:57:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 5352 transitions. [2019-12-08 15:57:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-08 15:57:54,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:54,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:54,337 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -738497021, now seen corresponding path program 8 times [2019-12-08 15:57:54,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:54,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179356410] [2019-12-08 15:57:54,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:54,566 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-08 15:57:54,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179356410] [2019-12-08 15:57:54,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:54,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-08 15:57:54,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25338890] [2019-12-08 15:57:54,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-08 15:57:54,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-08 15:57:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-08 15:57:54,569 INFO L87 Difference]: Start difference. First operand 2449 states and 5352 transitions. Second operand 11 states. [2019-12-08 15:57:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:56,401 INFO L93 Difference]: Finished difference Result 4553 states and 9932 transitions. [2019-12-08 15:57:56,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-08 15:57:56,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-12-08 15:57:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:56,408 INFO L225 Difference]: With dead ends: 4553 [2019-12-08 15:57:56,408 INFO L226 Difference]: Without dead ends: 4553 [2019-12-08 15:57:56,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-08 15:57:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2019-12-08 15:57:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 2447. [2019-12-08 15:57:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-08 15:57:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 5348 transitions. [2019-12-08 15:57:56,457 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 5348 transitions. Word has length 83 [2019-12-08 15:57:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:56,458 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 5348 transitions. [2019-12-08 15:57:56,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-08 15:57:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 5348 transitions. [2019-12-08 15:57:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-08 15:57:56,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:56,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:56,464 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:56,465 INFO L82 PathProgramCache]: Analyzing trace with hash 588669574, now seen corresponding path program 1 times [2019-12-08 15:57:56,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:56,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347669465] [2019-12-08 15:57:56,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:56,675 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-08 15:57:56,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347669465] [2019-12-08 15:57:56,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:56,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-08 15:57:56,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747237918] [2019-12-08 15:57:56,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 15:57:56,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 15:57:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-08 15:57:56,678 INFO L87 Difference]: Start difference. First operand 2447 states and 5348 transitions. Second operand 9 states. [2019-12-08 15:57:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:58,174 INFO L93 Difference]: Finished difference Result 4869 states and 10399 transitions. [2019-12-08 15:57:58,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-08 15:57:58,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-08 15:57:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:58,180 INFO L225 Difference]: With dead ends: 4869 [2019-12-08 15:57:58,180 INFO L226 Difference]: Without dead ends: 4869 [2019-12-08 15:57:58,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-08 15:57:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2019-12-08 15:57:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 3163. [2019-12-08 15:57:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3163 states. [2019-12-08 15:57:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 6891 transitions. [2019-12-08 15:57:58,220 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 6891 transitions. Word has length 84 [2019-12-08 15:57:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:58,221 INFO L462 AbstractCegarLoop]: Abstraction has 3163 states and 6891 transitions. [2019-12-08 15:57:58,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 15:57:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 6891 transitions. [2019-12-08 15:57:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-08 15:57:58,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:58,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:58,227 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:58,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1104508352, now seen corresponding path program 1 times [2019-12-08 15:57:58,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:58,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531910978] [2019-12-08 15:57:58,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:58,391 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-08 15:57:58,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531910978] [2019-12-08 15:57:58,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:58,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-08 15:57:58,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187259165] [2019-12-08 15:57:58,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-08 15:57:58,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-08 15:57:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-08 15:57:58,394 INFO L87 Difference]: Start difference. First operand 3163 states and 6891 transitions. Second operand 10 states. [2019-12-08 15:57:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:58,903 INFO L93 Difference]: Finished difference Result 5154 states and 11296 transitions. [2019-12-08 15:57:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-08 15:57:58,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-08 15:57:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:58,909 INFO L225 Difference]: With dead ends: 5154 [2019-12-08 15:57:58,909 INFO L226 Difference]: Without dead ends: 5122 [2019-12-08 15:57:58,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-08 15:57:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2019-12-08 15:57:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 4122. [2019-12-08 15:57:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4122 states. [2019-12-08 15:57:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 9078 transitions. [2019-12-08 15:57:58,958 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 9078 transitions. Word has length 84 [2019-12-08 15:57:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:58,958 INFO L462 AbstractCegarLoop]: Abstraction has 4122 states and 9078 transitions. [2019-12-08 15:57:58,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-08 15:57:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 9078 transitions. [2019-12-08 15:57:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-08 15:57:58,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:58,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:58,964 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:58,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1761939513, now seen corresponding path program 1 times [2019-12-08 15:57:58,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:58,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905263062] [2019-12-08 15:57:58,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:57:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:57:59,166 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-08 15:57:59,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905263062] [2019-12-08 15:57:59,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:57:59,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-08 15:57:59,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119353144] [2019-12-08 15:57:59,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-08 15:57:59,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:57:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-08 15:57:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-08 15:57:59,168 INFO L87 Difference]: Start difference. First operand 4122 states and 9078 transitions. Second operand 11 states. [2019-12-08 15:57:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:57:59,918 INFO L93 Difference]: Finished difference Result 7670 states and 16529 transitions. [2019-12-08 15:57:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-08 15:57:59,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-12-08 15:57:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:57:59,925 INFO L225 Difference]: With dead ends: 7670 [2019-12-08 15:57:59,925 INFO L226 Difference]: Without dead ends: 4753 [2019-12-08 15:57:59,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2019-12-08 15:57:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-08 15:57:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 3508. [2019-12-08 15:57:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3508 states. [2019-12-08 15:57:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 7501 transitions. [2019-12-08 15:57:59,974 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 7501 transitions. Word has length 85 [2019-12-08 15:57:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:57:59,974 INFO L462 AbstractCegarLoop]: Abstraction has 3508 states and 7501 transitions. [2019-12-08 15:57:59,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-08 15:57:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 7501 transitions. [2019-12-08 15:57:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-08 15:57:59,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:57:59,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:57:59,982 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:57:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:57:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1370724916, now seen corresponding path program 1 times [2019-12-08 15:57:59,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:57:59,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232857151] [2019-12-08 15:57:59,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:00,272 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-08 15:58:00,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232857151] [2019-12-08 15:58:00,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:00,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-08 15:58:00,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289286041] [2019-12-08 15:58:00,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-08 15:58:00,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-08 15:58:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-08 15:58:00,274 INFO L87 Difference]: Start difference. First operand 3508 states and 7501 transitions. Second operand 14 states. [2019-12-08 15:58:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:01,203 INFO L93 Difference]: Finished difference Result 4444 states and 9291 transitions. [2019-12-08 15:58:01,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-08 15:58:01,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2019-12-08 15:58:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:01,209 INFO L225 Difference]: With dead ends: 4444 [2019-12-08 15:58:01,209 INFO L226 Difference]: Without dead ends: 4340 [2019-12-08 15:58:01,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-08 15:58:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2019-12-08 15:58:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 3079. [2019-12-08 15:58:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3079 states. [2019-12-08 15:58:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 6628 transitions. [2019-12-08 15:58:01,253 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 6628 transitions. Word has length 86 [2019-12-08 15:58:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 3079 states and 6628 transitions. [2019-12-08 15:58:01,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-08 15:58:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 6628 transitions. [2019-12-08 15:58:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-08 15:58:01,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:01,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:01,260 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1543760090, now seen corresponding path program 2 times [2019-12-08 15:58:01,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:01,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761422004] [2019-12-08 15:58:01,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:58:01,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761422004] [2019-12-08 15:58:01,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:01,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 15:58:01,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424923089] [2019-12-08 15:58:01,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:58:01,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:01,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:58:01,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:58:01,359 INFO L87 Difference]: Start difference. First operand 3079 states and 6628 transitions. Second operand 5 states. [2019-12-08 15:58:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:01,612 INFO L93 Difference]: Finished difference Result 4387 states and 9461 transitions. [2019-12-08 15:58:01,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 15:58:01,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-08 15:58:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:01,618 INFO L225 Difference]: With dead ends: 4387 [2019-12-08 15:58:01,618 INFO L226 Difference]: Without dead ends: 4387 [2019-12-08 15:58:01,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:58:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2019-12-08 15:58:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 3552. [2019-12-08 15:58:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-12-08 15:58:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 7653 transitions. [2019-12-08 15:58:01,659 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 7653 transitions. Word has length 86 [2019-12-08 15:58:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:01,660 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 7653 transitions. [2019-12-08 15:58:01,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:58:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 7653 transitions. [2019-12-08 15:58:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-08 15:58:01,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:01,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:01,665 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1563899026, now seen corresponding path program 1 times [2019-12-08 15:58:01,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:01,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715707522] [2019-12-08 15:58:01,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:01,774 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-08 15:58:01,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715707522] [2019-12-08 15:58:01,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:01,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 15:58:01,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371694815] [2019-12-08 15:58:01,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 15:58:01,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 15:58:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:58:01,777 INFO L87 Difference]: Start difference. First operand 3552 states and 7653 transitions. Second operand 6 states. [2019-12-08 15:58:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:02,120 INFO L93 Difference]: Finished difference Result 3791 states and 8058 transitions. [2019-12-08 15:58:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 15:58:02,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-12-08 15:58:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:02,126 INFO L225 Difference]: With dead ends: 3791 [2019-12-08 15:58:02,126 INFO L226 Difference]: Without dead ends: 3680 [2019-12-08 15:58:02,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-08 15:58:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-12-08 15:58:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3516. [2019-12-08 15:58:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3516 states. [2019-12-08 15:58:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 7567 transitions. [2019-12-08 15:58:02,186 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 7567 transitions. Word has length 87 [2019-12-08 15:58:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:02,187 INFO L462 AbstractCegarLoop]: Abstraction has 3516 states and 7567 transitions. [2019-12-08 15:58:02,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 15:58:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 7567 transitions. [2019-12-08 15:58:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-08 15:58:02,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:02,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:02,194 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash -126478383, now seen corresponding path program 1 times [2019-12-08 15:58:02,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:02,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016610177] [2019-12-08 15:58:02,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:02,396 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-08 15:58:02,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016610177] [2019-12-08 15:58:02,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:02,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-08 15:58:02,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184089473] [2019-12-08 15:58:02,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 15:58:02,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 15:58:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-08 15:58:02,399 INFO L87 Difference]: Start difference. First operand 3516 states and 7567 transitions. Second operand 9 states. [2019-12-08 15:58:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:03,367 INFO L93 Difference]: Finished difference Result 5606 states and 12000 transitions. [2019-12-08 15:58:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-08 15:58:03,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-08 15:58:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:03,375 INFO L225 Difference]: With dead ends: 5606 [2019-12-08 15:58:03,375 INFO L226 Difference]: Without dead ends: 5543 [2019-12-08 15:58:03,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-08 15:58:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2019-12-08 15:58:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 3734. [2019-12-08 15:58:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3734 states. [2019-12-08 15:58:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 8040 transitions. [2019-12-08 15:58:03,428 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 8040 transitions. Word has length 87 [2019-12-08 15:58:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:03,429 INFO L462 AbstractCegarLoop]: Abstraction has 3734 states and 8040 transitions. [2019-12-08 15:58:03,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 15:58:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 8040 transitions. [2019-12-08 15:58:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-08 15:58:03,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:03,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:03,436 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1151333618, now seen corresponding path program 1 times [2019-12-08 15:58:03,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:03,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532253044] [2019-12-08 15:58:03,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:03,847 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-08 15:58:03,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532253044] [2019-12-08 15:58:03,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:03,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-08 15:58:03,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294528722] [2019-12-08 15:58:03,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-08 15:58:03,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-08 15:58:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-08 15:58:03,850 INFO L87 Difference]: Start difference. First operand 3734 states and 8040 transitions. Second operand 16 states. [2019-12-08 15:58:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:05,194 INFO L93 Difference]: Finished difference Result 7423 states and 16089 transitions. [2019-12-08 15:58:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-08 15:58:05,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-12-08 15:58:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:05,203 INFO L225 Difference]: With dead ends: 7423 [2019-12-08 15:58:05,203 INFO L226 Difference]: Without dead ends: 7320 [2019-12-08 15:58:05,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2019-12-08 15:58:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2019-12-08 15:58:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 3918. [2019-12-08 15:58:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3918 states. [2019-12-08 15:58:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 8462 transitions. [2019-12-08 15:58:05,253 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 8462 transitions. Word has length 87 [2019-12-08 15:58:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:05,253 INFO L462 AbstractCegarLoop]: Abstraction has 3918 states and 8462 transitions. [2019-12-08 15:58:05,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-08 15:58:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 8462 transitions. [2019-12-08 15:58:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-08 15:58:05,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:05,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:05,260 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash -766393236, now seen corresponding path program 2 times [2019-12-08 15:58:05,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:05,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995585517] [2019-12-08 15:58:05,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 15:58:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 15:58:05,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-08 15:58:05,416 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-08 15:58:05,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1597~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1598~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-08 15:58:05,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-08 15:58:05,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_8|) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-08 15:58:05,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-219065397 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-219065397 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-219065397| ~y$w_buff1~0_In-219065397) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-219065397| ~y$w_buff0~0_In-219065397) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-219065397, ~y$w_buff1~0=~y$w_buff1~0_In-219065397, ~y$w_buff0~0=~y$w_buff0~0_In-219065397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-219065397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-219065397, ~y$w_buff1~0=~y$w_buff1~0_In-219065397, ~y$w_buff0~0=~y$w_buff0~0_In-219065397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-219065397, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-219065397|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-08 15:58:05,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_10|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_10|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_9|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_13|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-08 15:58:05,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-08 15:58:05,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1135686090 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out1135686090| ~y$mem_tmp~0_In1135686090)) (and .cse0 (= ~y~0_In1135686090 |P1Thread1of1ForFork1_#t~ite31_Out1135686090|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1135686090, ~y$flush_delayed~0=~y$flush_delayed~0_In1135686090, ~y~0=~y~0_In1135686090} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1135686090, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1135686090|, ~y$flush_delayed~0=~y$flush_delayed~0_In1135686090, ~y~0=~y~0_In1135686090} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-08 15:58:05,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-777420405 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-777420405 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-777420405| |P0Thread1of1ForFork0_#t~ite4_Out-777420405|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-777420405| ~y$w_buff1~0_In-777420405)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-777420405| ~y~0_In-777420405) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-777420405, ~y$w_buff1~0=~y$w_buff1~0_In-777420405, ~y~0=~y~0_In-777420405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777420405} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-777420405, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-777420405|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-777420405|, ~y$w_buff1~0=~y$w_buff1~0_In-777420405, ~y~0=~y~0_In-777420405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777420405} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-08 15:58:05,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1438265804 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1438265804 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1438265804 |P1Thread1of1ForFork1_#t~ite34_Out1438265804|)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In1438265804 |P1Thread1of1ForFork1_#t~ite34_Out1438265804|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1438265804, ~y$w_buff1~0=~y$w_buff1~0_In1438265804, ~y$w_buff0~0=~y$w_buff0~0_In1438265804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1438265804} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1438265804, ~y$w_buff1~0=~y$w_buff1~0_In1438265804, ~y$w_buff0~0=~y$w_buff0~0_In1438265804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1438265804, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1438265804|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-08 15:58:05,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-08 15:58:05,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_11|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-08 15:58:05,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In348360575 256)))) (or (and (= ~y$mem_tmp~0_In348360575 |P1Thread1of1ForFork1_#t~ite54_Out348360575|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out348360575| ~y~0_In348360575)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In348360575, ~y$flush_delayed~0=~y$flush_delayed~0_In348360575, ~y~0=~y~0_In348360575} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In348360575, ~y$flush_delayed~0=~y$flush_delayed~0_In348360575, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out348360575|, ~y~0=~y~0_In348360575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-08 15:58:05,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1617392582 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1617392582 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1617392582|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1617392582| ~y$w_buff0_used~0_In1617392582) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1617392582, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1617392582} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1617392582|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1617392582, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1617392582} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-08 15:58:05,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In392890771 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In392890771 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In392890771 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In392890771 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out392890771|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In392890771 |P0Thread1of1ForFork0_#t~ite6_Out392890771|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In392890771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In392890771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In392890771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In392890771} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out392890771|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In392890771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In392890771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In392890771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In392890771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-08 15:58:05,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-807149260 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-807149260 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-807149260 |P0Thread1of1ForFork0_#t~ite7_Out-807149260|)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-807149260| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-807149260, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-807149260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-807149260, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-807149260|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-807149260} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-08 15:58:05,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In478970794 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In478970794 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In478970794 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In478970794 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out478970794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out478970794| ~y$r_buff1_thd1~0_In478970794) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In478970794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In478970794, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In478970794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478970794} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In478970794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In478970794, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out478970794|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In478970794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478970794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-08 15:58:05,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-08 15:58:05,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2144878845 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2144878845 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out-2144878845| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite57_Out-2144878845| ~y$w_buff0_used~0_In-2144878845) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144878845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144878845} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144878845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144878845, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-2144878845|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-08 15:58:05,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-948697064 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-948697064 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-948697064 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-948697064 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite58_Out-948697064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite58_Out-948697064| ~y$w_buff1_used~0_In-948697064) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-948697064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-948697064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948697064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948697064} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-948697064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-948697064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948697064, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-948697064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948697064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-08 15:58:05,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In765753575 256))) (.cse0 (= ~y$r_buff0_thd2~0_In765753575 ~y$r_buff0_thd2~0_Out765753575)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In765753575 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out765753575) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In765753575, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In765753575} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In765753575, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out765753575, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out765753575|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-08 15:58:05,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1663323230 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1663323230 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1663323230 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1663323230 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out1663323230| ~y$r_buff1_thd2~0_In1663323230) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite60_Out1663323230| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663323230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663323230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663323230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663323230} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663323230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663323230, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1663323230|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663323230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663323230} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-08 15:58:05,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-08 15:58:05,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-08 15:58:05,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In106054138 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In106054138 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In106054138 |ULTIMATE.start_main_#t~ite63_Out106054138|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In106054138 |ULTIMATE.start_main_#t~ite63_Out106054138|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In106054138, ~y~0=~y~0_In106054138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106054138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106054138} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out106054138|, ~y$w_buff1~0=~y$w_buff1~0_In106054138, ~y~0=~y~0_In106054138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106054138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106054138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-08 15:58:05,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-08 15:58:05,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1225415952 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1225415952 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-1225415952| ~y$w_buff0_used~0_In-1225415952)) (and (= |ULTIMATE.start_main_#t~ite65_Out-1225415952| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225415952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225415952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225415952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225415952, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1225415952|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-08 15:58:05,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-954042002 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-954042002 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-954042002 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-954042002 256)))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out-954042002| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-954042002| ~y$w_buff1_used~0_In-954042002)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-954042002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-954042002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-954042002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954042002} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-954042002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-954042002, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-954042002|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-954042002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954042002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-08 15:58:05,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2041146804 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2041146804 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-2041146804|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-2041146804 |ULTIMATE.start_main_#t~ite67_Out-2041146804|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2041146804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2041146804} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2041146804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2041146804, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-2041146804|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-08 15:58:05,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1418612733 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1418612733 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1418612733 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1418612733 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out1418612733| ~y$r_buff1_thd0~0_In1418612733) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite68_Out1418612733| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1418612733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1418612733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1418612733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418612733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1418612733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1418612733, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1418612733|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1418612733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418612733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-08 15:58:05,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1584726532 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out-1584726532| ~y$mem_tmp~0_In-1584726532) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite91_Out-1584726532| ~y~0_In-1584726532) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1584726532, ~y$flush_delayed~0=~y$flush_delayed~0_In-1584726532, ~y~0=~y~0_In-1584726532} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1584726532, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1584726532|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1584726532, ~y~0=~y~0_In-1584726532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-08 15:58:05,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-08 15:58:05,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:58:05 BasicIcfg [2019-12-08 15:58:05,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 15:58:05,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 15:58:05,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 15:58:05,605 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 15:58:05,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:57:26" (3/4) ... [2019-12-08 15:58:05,609 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-08 15:58:05,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1597~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1598~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-08 15:58:05,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-08 15:58:05,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_8|) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-08 15:58:05,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-219065397 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-219065397 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-219065397| ~y$w_buff1~0_In-219065397) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-219065397| ~y$w_buff0~0_In-219065397) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-219065397, ~y$w_buff1~0=~y$w_buff1~0_In-219065397, ~y$w_buff0~0=~y$w_buff0~0_In-219065397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-219065397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-219065397, ~y$w_buff1~0=~y$w_buff1~0_In-219065397, ~y$w_buff0~0=~y$w_buff0~0_In-219065397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-219065397, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-219065397|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-08 15:58:05,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_10|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_10|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_9|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_13|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-08 15:58:05,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-08 15:58:05,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1135686090 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out1135686090| ~y$mem_tmp~0_In1135686090)) (and .cse0 (= ~y~0_In1135686090 |P1Thread1of1ForFork1_#t~ite31_Out1135686090|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1135686090, ~y$flush_delayed~0=~y$flush_delayed~0_In1135686090, ~y~0=~y~0_In1135686090} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1135686090, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1135686090|, ~y$flush_delayed~0=~y$flush_delayed~0_In1135686090, ~y~0=~y~0_In1135686090} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-08 15:58:05,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-777420405 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-777420405 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-777420405| |P0Thread1of1ForFork0_#t~ite4_Out-777420405|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-777420405| ~y$w_buff1~0_In-777420405)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-777420405| ~y~0_In-777420405) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-777420405, ~y$w_buff1~0=~y$w_buff1~0_In-777420405, ~y~0=~y~0_In-777420405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777420405} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-777420405, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-777420405|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-777420405|, ~y$w_buff1~0=~y$w_buff1~0_In-777420405, ~y~0=~y~0_In-777420405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777420405} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-08 15:58:05,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1438265804 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1438265804 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1438265804 |P1Thread1of1ForFork1_#t~ite34_Out1438265804|)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In1438265804 |P1Thread1of1ForFork1_#t~ite34_Out1438265804|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1438265804, ~y$w_buff1~0=~y$w_buff1~0_In1438265804, ~y$w_buff0~0=~y$w_buff0~0_In1438265804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1438265804} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1438265804, ~y$w_buff1~0=~y$w_buff1~0_In1438265804, ~y$w_buff0~0=~y$w_buff0~0_In1438265804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1438265804, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1438265804|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-08 15:58:05,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-08 15:58:05,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_11|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-08 15:58:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In348360575 256)))) (or (and (= ~y$mem_tmp~0_In348360575 |P1Thread1of1ForFork1_#t~ite54_Out348360575|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out348360575| ~y~0_In348360575)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In348360575, ~y$flush_delayed~0=~y$flush_delayed~0_In348360575, ~y~0=~y~0_In348360575} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In348360575, ~y$flush_delayed~0=~y$flush_delayed~0_In348360575, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out348360575|, ~y~0=~y~0_In348360575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-08 15:58:05,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1617392582 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1617392582 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1617392582|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1617392582| ~y$w_buff0_used~0_In1617392582) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1617392582, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1617392582} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1617392582|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1617392582, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1617392582} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-08 15:58:05,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In392890771 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In392890771 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In392890771 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In392890771 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out392890771|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In392890771 |P0Thread1of1ForFork0_#t~ite6_Out392890771|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In392890771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In392890771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In392890771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In392890771} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out392890771|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In392890771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In392890771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In392890771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In392890771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-08 15:58:05,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-807149260 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-807149260 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-807149260 |P0Thread1of1ForFork0_#t~ite7_Out-807149260|)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-807149260| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-807149260, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-807149260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-807149260, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-807149260|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-807149260} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-08 15:58:05,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In478970794 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In478970794 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In478970794 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In478970794 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out478970794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out478970794| ~y$r_buff1_thd1~0_In478970794) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In478970794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In478970794, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In478970794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478970794} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In478970794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In478970794, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out478970794|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In478970794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478970794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-08 15:58:05,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-08 15:58:05,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2144878845 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2144878845 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out-2144878845| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite57_Out-2144878845| ~y$w_buff0_used~0_In-2144878845) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144878845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144878845} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144878845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144878845, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-2144878845|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-08 15:58:05,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-948697064 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-948697064 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-948697064 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-948697064 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite58_Out-948697064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite58_Out-948697064| ~y$w_buff1_used~0_In-948697064) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-948697064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-948697064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948697064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948697064} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-948697064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-948697064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948697064, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-948697064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948697064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-08 15:58:05,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In765753575 256))) (.cse0 (= ~y$r_buff0_thd2~0_In765753575 ~y$r_buff0_thd2~0_Out765753575)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In765753575 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out765753575) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In765753575, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In765753575} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In765753575, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out765753575, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out765753575|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-08 15:58:05,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1663323230 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1663323230 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1663323230 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1663323230 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out1663323230| ~y$r_buff1_thd2~0_In1663323230) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite60_Out1663323230| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663323230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663323230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663323230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663323230} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663323230, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663323230, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1663323230|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663323230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663323230} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-08 15:58:05,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-08 15:58:05,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-08 15:58:05,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In106054138 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In106054138 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In106054138 |ULTIMATE.start_main_#t~ite63_Out106054138|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In106054138 |ULTIMATE.start_main_#t~ite63_Out106054138|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In106054138, ~y~0=~y~0_In106054138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106054138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106054138} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out106054138|, ~y$w_buff1~0=~y$w_buff1~0_In106054138, ~y~0=~y~0_In106054138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106054138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106054138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-08 15:58:05,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-08 15:58:05,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1225415952 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1225415952 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-1225415952| ~y$w_buff0_used~0_In-1225415952)) (and (= |ULTIMATE.start_main_#t~ite65_Out-1225415952| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225415952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225415952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225415952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225415952, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1225415952|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-08 15:58:05,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-954042002 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-954042002 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-954042002 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-954042002 256)))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out-954042002| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-954042002| ~y$w_buff1_used~0_In-954042002)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-954042002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-954042002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-954042002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954042002} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-954042002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-954042002, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-954042002|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-954042002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954042002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-08 15:58:05,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2041146804 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2041146804 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-2041146804|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-2041146804 |ULTIMATE.start_main_#t~ite67_Out-2041146804|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2041146804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2041146804} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2041146804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2041146804, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-2041146804|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-08 15:58:05,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1418612733 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1418612733 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1418612733 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1418612733 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out1418612733| ~y$r_buff1_thd0~0_In1418612733) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite68_Out1418612733| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1418612733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1418612733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1418612733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418612733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1418612733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1418612733, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1418612733|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1418612733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418612733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-08 15:58:05,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1584726532 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out-1584726532| ~y$mem_tmp~0_In-1584726532) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite91_Out-1584726532| ~y~0_In-1584726532) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1584726532, ~y$flush_delayed~0=~y$flush_delayed~0_In-1584726532, ~y~0=~y~0_In-1584726532} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1584726532, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1584726532|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1584726532, ~y~0=~y~0_In-1584726532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-08 15:58:05,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-08 15:58:05,874 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-12-08 15:58:05,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 15:58:05,876 INFO L168 Benchmark]: Toolchain (without parser) took 41233.15 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 957.7 MB in the beginning and 1.5 GB in the end (delta: -556.5 MB). Peak memory consumption was 742.7 MB. Max. memory is 11.5 GB. [2019-12-08 15:58:05,877 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 15:58:05,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-12-08 15:58:05,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 15:58:05,879 INFO L168 Benchmark]: Boogie Preprocessor took 71.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-08 15:58:05,880 INFO L168 Benchmark]: RCFGBuilder took 1296.57 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: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-12-08 15:58:05,880 INFO L168 Benchmark]: TraceAbstraction took 38700.87 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -502.9 MB). Peak memory consumption was 643.2 MB. Max. memory is 11.5 GB. [2019-12-08 15:58:05,881 INFO L168 Benchmark]: Witness Printer took 270.25 ms. Allocated memory is still 2.3 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-08 15:58:05,883 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.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 799.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1296.57 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: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38700.87 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -502.9 MB). Peak memory consumption was 643.2 MB. Max. memory is 11.5 GB. * Witness Printer took 270.25 ms. Allocated memory is still 2.3 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.2s, 231 ProgramPointsBefore, 147 ProgramPointsAfterwards, 307 TransitionsBefore, 184 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 42 ChoiceCompositions, 15276 VarBasedMoverChecksPositive, 410 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 446 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 232725 CheckedPairsTotal, 139 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6943 SDtfs, 9408 SDslu, 26149 SDs, 0 SdLazy, 12823 SolverSat, 562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 59 SyntacticMatches, 40 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50078occurred 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: 4.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 21004 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1524 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1416 ConstructedInterpolants, 0 QuantifiedInterpolants, 512189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...