./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8cd42fdc0e6d134624cee6776755ac675531487 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:50:41,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:50:41,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:50:41,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:50:41,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:50:41,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:50:41,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:50:41,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:50:41,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:50:41,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:50:41,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:50:41,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:50:41,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:50:41,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:50:41,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:50:41,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:50:41,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:50:41,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:50:41,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:50:41,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:50:41,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:50:41,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:50:41,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:50:41,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:50:41,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:50:41,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:50:41,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:50:41,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:50:41,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:50:41,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:50:41,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:50:41,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:50:41,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:50:41,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:50:41,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:50:41,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:50:41,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:50:41,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:50:41,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:50:41,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:50:41,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:50:41,338 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:50:41,351 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:50:41,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:50:41,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:50:41,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:50:41,352 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:50:41,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:50:41,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:50:41,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:50:41,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:50:41,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:50:41,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:50:41,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:50:41,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:50:41,354 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:50:41,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:50:41,354 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:50:41,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:50:41,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:50:41,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:50:41,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:50:41,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:50:41,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:50:41,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:50:41,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:50:41,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:50:41,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:50:41,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:50:41,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:50:41,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:50:41,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8cd42fdc0e6d134624cee6776755ac675531487 [2019-12-07 12:50:41,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:50:41,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:50:41,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:50:41,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:50:41,484 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:50:41,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i [2019-12-07 12:50:41,524 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/data/4ee478830/6e7b10bbf3e24249aee918d757a5de38/FLAGfea887dd8 [2019-12-07 12:50:41,989 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:50:41,990 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i [2019-12-07 12:50:42,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/data/4ee478830/6e7b10bbf3e24249aee918d757a5de38/FLAGfea887dd8 [2019-12-07 12:50:42,009 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/data/4ee478830/6e7b10bbf3e24249aee918d757a5de38 [2019-12-07 12:50:42,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:50:42,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:50:42,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:50:42,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:50:42,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:50:42,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42, skipping insertion in model container [2019-12-07 12:50:42,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:50:42,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:50:42,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:50:42,311 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:50:42,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:50:42,407 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:50:42,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42 WrapperNode [2019-12-07 12:50:42,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:50:42,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:50:42,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:50:42,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:50:42,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:50:42,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:50:42,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:50:42,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:50:42,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... [2019-12-07 12:50:42,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:50:42,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:50:42,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:50:42,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:50:42,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:50:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:50:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:50:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:50:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:50:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:50:42,529 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:50:43,002 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:50:43,002 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:50:43,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:43 BoogieIcfgContainer [2019-12-07 12:50:43,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:50:43,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:50:43,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:50:43,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:50:43,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:50:42" (1/3) ... [2019-12-07 12:50:43,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad54628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:50:43, skipping insertion in model container [2019-12-07 12:50:43,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:50:42" (2/3) ... [2019-12-07 12:50:43,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad54628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:50:43, skipping insertion in model container [2019-12-07 12:50:43,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:43" (3/3) ... [2019-12-07 12:50:43,008 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.oepc.i [2019-12-07 12:50:43,015 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:50:43,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:50:43,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:50:43,021 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:50:43,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,059 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,059 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,059 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:50:43,094 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:50:43,107 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:50:43,108 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:50:43,108 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:50:43,108 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:50:43,108 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:50:43,108 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:50:43,108 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:50:43,108 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:50:43,121 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-07 12:50:43,122 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-07 12:50:43,210 INFO L134 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-07 12:50:43,211 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:50:43,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1350 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-07 12:50:43,278 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-07 12:50:43,338 INFO L134 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-07 12:50:43,338 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:50:43,354 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1350 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-07 12:50:43,391 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-07 12:50:43,392 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:50:47,247 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 12:50:47,396 INFO L206 etLargeBlockEncoding]: Checked pairs total: 282427 [2019-12-07 12:50:47,396 INFO L214 etLargeBlockEncoding]: Total number of compositions: 142 [2019-12-07 12:50:47,399 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 192 transitions [2019-12-07 12:50:54,694 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86906 states. [2019-12-07 12:50:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 86906 states. [2019-12-07 12:50:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:50:54,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:54,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:50:54,701 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240646, now seen corresponding path program 1 times [2019-12-07 12:50:54,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:54,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974007949] [2019-12-07 12:50:54,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:54,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974007949] [2019-12-07 12:50:54,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:54,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:50:54,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70936349] [2019-12-07 12:50:54,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:54,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:54,876 INFO L87 Difference]: Start difference. First operand 86906 states. Second operand 3 states. [2019-12-07 12:50:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:55,514 INFO L93 Difference]: Finished difference Result 86858 states and 312643 transitions. [2019-12-07 12:50:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:55,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:50:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:55,930 INFO L225 Difference]: With dead ends: 86858 [2019-12-07 12:50:55,930 INFO L226 Difference]: Without dead ends: 85058 [2019-12-07 12:50:55,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85058 states. [2019-12-07 12:50:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85058 to 85058. [2019-12-07 12:50:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85058 states. [2019-12-07 12:50:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85058 states to 85058 states and 306544 transitions. [2019-12-07 12:50:59,734 INFO L78 Accepts]: Start accepts. Automaton has 85058 states and 306544 transitions. Word has length 5 [2019-12-07 12:50:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:59,735 INFO L462 AbstractCegarLoop]: Abstraction has 85058 states and 306544 transitions. [2019-12-07 12:50:59,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 85058 states and 306544 transitions. [2019-12-07 12:50:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:50:59,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:59,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:59,737 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2045261550, now seen corresponding path program 1 times [2019-12-07 12:50:59,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:59,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872617619] [2019-12-07 12:50:59,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:59,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872617619] [2019-12-07 12:50:59,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:59,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:59,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526953223] [2019-12-07 12:50:59,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:59,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:59,793 INFO L87 Difference]: Start difference. First operand 85058 states and 306544 transitions. Second operand 4 states. [2019-12-07 12:51:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:02,020 INFO L93 Difference]: Finished difference Result 127330 states and 444666 transitions. [2019-12-07 12:51:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:51:02,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:51:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:02,253 INFO L225 Difference]: With dead ends: 127330 [2019-12-07 12:51:02,253 INFO L226 Difference]: Without dead ends: 127330 [2019-12-07 12:51:02,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:51:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127330 states. [2019-12-07 12:51:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127330 to 126190. [2019-12-07 12:51:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126190 states. [2019-12-07 12:51:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126190 states to 126190 states and 441366 transitions. [2019-12-07 12:51:06,731 INFO L78 Accepts]: Start accepts. Automaton has 126190 states and 441366 transitions. Word has length 11 [2019-12-07 12:51:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:06,731 INFO L462 AbstractCegarLoop]: Abstraction has 126190 states and 441366 transitions. [2019-12-07 12:51:06,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:51:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 126190 states and 441366 transitions. [2019-12-07 12:51:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:51:06,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:06,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:06,734 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 216920818, now seen corresponding path program 1 times [2019-12-07 12:51:06,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:06,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963847065] [2019-12-07 12:51:06,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:06,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963847065] [2019-12-07 12:51:06,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:06,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:51:06,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143300141] [2019-12-07 12:51:06,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:51:06,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:06,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:51:06,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:51:06,768 INFO L87 Difference]: Start difference. First operand 126190 states and 441366 transitions. Second operand 3 states. [2019-12-07 12:51:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:06,787 INFO L93 Difference]: Finished difference Result 7755 states and 18817 transitions. [2019-12-07 12:51:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:51:06,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 12:51:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:06,794 INFO L225 Difference]: With dead ends: 7755 [2019-12-07 12:51:06,794 INFO L226 Difference]: Without dead ends: 7755 [2019-12-07 12:51:06,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:51:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-07 12:51:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7715. [2019-12-07 12:51:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-12-07 12:51:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 18737 transitions. [2019-12-07 12:51:06,879 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 18737 transitions. Word has length 11 [2019-12-07 12:51:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 7715 states and 18737 transitions. [2019-12-07 12:51:06,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:51:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 18737 transitions. [2019-12-07 12:51:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:51:06,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:06,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:06,883 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash -468341505, now seen corresponding path program 1 times [2019-12-07 12:51:06,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:06,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663416181] [2019-12-07 12:51:06,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:06,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663416181] [2019-12-07 12:51:06,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:06,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:51:06,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218742568] [2019-12-07 12:51:06,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:51:06,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:06,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:51:06,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:06,994 INFO L87 Difference]: Start difference. First operand 7715 states and 18737 transitions. Second operand 7 states. [2019-12-07 12:51:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:07,535 INFO L93 Difference]: Finished difference Result 9139 states and 21753 transitions. [2019-12-07 12:51:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:51:07,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 12:51:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:07,542 INFO L225 Difference]: With dead ends: 9139 [2019-12-07 12:51:07,542 INFO L226 Difference]: Without dead ends: 9139 [2019-12-07 12:51:07,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:51:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-12-07 12:51:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 8897. [2019-12-07 12:51:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2019-12-07 12:51:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 21286 transitions. [2019-12-07 12:51:07,631 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 21286 transitions. Word has length 22 [2019-12-07 12:51:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:07,632 INFO L462 AbstractCegarLoop]: Abstraction has 8897 states and 21286 transitions. [2019-12-07 12:51:07,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:51:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 21286 transitions. [2019-12-07 12:51:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 12:51:07,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:07,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:07,635 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:07,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1753070628, now seen corresponding path program 1 times [2019-12-07 12:51:07,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:07,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141902965] [2019-12-07 12:51:07,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:07,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141902965] [2019-12-07 12:51:07,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:07,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:51:07,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471924009] [2019-12-07 12:51:07,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:51:07,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:51:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:51:07,762 INFO L87 Difference]: Start difference. First operand 8897 states and 21286 transitions. Second operand 8 states. [2019-12-07 12:51:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:08,432 INFO L93 Difference]: Finished difference Result 10822 states and 25610 transitions. [2019-12-07 12:51:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:51:08,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 12:51:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:08,440 INFO L225 Difference]: With dead ends: 10822 [2019-12-07 12:51:08,440 INFO L226 Difference]: Without dead ends: 10822 [2019-12-07 12:51:08,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:51:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10822 states. [2019-12-07 12:51:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10822 to 10278. [2019-12-07 12:51:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10278 states. [2019-12-07 12:51:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10278 states to 10278 states and 24484 transitions. [2019-12-07 12:51:08,548 INFO L78 Accepts]: Start accepts. Automaton has 10278 states and 24484 transitions. Word has length 34 [2019-12-07 12:51:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:08,549 INFO L462 AbstractCegarLoop]: Abstraction has 10278 states and 24484 transitions. [2019-12-07 12:51:08,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:51:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 10278 states and 24484 transitions. [2019-12-07 12:51:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:51:08,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:08,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:08,556 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1451730190, now seen corresponding path program 1 times [2019-12-07 12:51:08,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:08,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701616634] [2019-12-07 12:51:08,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:08,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701616634] [2019-12-07 12:51:08,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:08,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:51:08,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340513476] [2019-12-07 12:51:08,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:51:08,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:51:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:51:08,627 INFO L87 Difference]: Start difference. First operand 10278 states and 24484 transitions. Second operand 4 states. [2019-12-07 12:51:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:08,644 INFO L93 Difference]: Finished difference Result 3430 states and 7653 transitions. [2019-12-07 12:51:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:51:08,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 12:51:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:08,648 INFO L225 Difference]: With dead ends: 3430 [2019-12-07 12:51:08,648 INFO L226 Difference]: Without dead ends: 3430 [2019-12-07 12:51:08,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:51:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-12-07 12:51:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3354. [2019-12-07 12:51:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-12-07 12:51:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 7512 transitions. [2019-12-07 12:51:08,686 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 7512 transitions. Word has length 48 [2019-12-07 12:51:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:08,686 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 7512 transitions. [2019-12-07 12:51:08,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:51:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 7512 transitions. [2019-12-07 12:51:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 12:51:08,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:08,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:08,691 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1776556996, now seen corresponding path program 1 times [2019-12-07 12:51:08,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:08,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918173659] [2019-12-07 12:51:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:08,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918173659] [2019-12-07 12:51:08,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:08,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:51:08,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421286799] [2019-12-07 12:51:08,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:51:08,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:51:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:51:08,757 INFO L87 Difference]: Start difference. First operand 3354 states and 7512 transitions. Second operand 3 states. [2019-12-07 12:51:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:08,780 INFO L93 Difference]: Finished difference Result 3354 states and 7437 transitions. [2019-12-07 12:51:08,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:51:08,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 12:51:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:08,782 INFO L225 Difference]: With dead ends: 3354 [2019-12-07 12:51:08,783 INFO L226 Difference]: Without dead ends: 3354 [2019-12-07 12:51:08,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:51:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-12-07 12:51:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3354. [2019-12-07 12:51:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-12-07 12:51:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 7437 transitions. [2019-12-07 12:51:08,812 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 7437 transitions. Word has length 93 [2019-12-07 12:51:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:08,813 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 7437 transitions. [2019-12-07 12:51:08,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:51:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 7437 transitions. [2019-12-07 12:51:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:08,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:08,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:08,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1261390719, now seen corresponding path program 1 times [2019-12-07 12:51:08,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:08,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927491243] [2019-12-07 12:51:08,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:08,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927491243] [2019-12-07 12:51:08,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:08,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:51:08,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502325611] [2019-12-07 12:51:08,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:51:08,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:51:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:08,895 INFO L87 Difference]: Start difference. First operand 3354 states and 7437 transitions. Second operand 7 states. [2019-12-07 12:51:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:09,548 INFO L93 Difference]: Finished difference Result 4179 states and 9176 transitions. [2019-12-07 12:51:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:51:09,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 12:51:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:09,552 INFO L225 Difference]: With dead ends: 4179 [2019-12-07 12:51:09,552 INFO L226 Difference]: Without dead ends: 4179 [2019-12-07 12:51:09,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:51:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2019-12-07 12:51:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3937. [2019-12-07 12:51:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-12-07 12:51:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 8683 transitions. [2019-12-07 12:51:09,597 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 8683 transitions. Word has length 94 [2019-12-07 12:51:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:09,597 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 8683 transitions. [2019-12-07 12:51:09,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:51:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 8683 transitions. [2019-12-07 12:51:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:09,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:09,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:09,603 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:09,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:09,603 INFO L82 PathProgramCache]: Analyzing trace with hash 870783717, now seen corresponding path program 2 times [2019-12-07 12:51:09,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:09,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008716338] [2019-12-07 12:51:09,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:09,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008716338] [2019-12-07 12:51:09,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:09,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:51:09,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358290516] [2019-12-07 12:51:09,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:51:09,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:51:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:51:09,707 INFO L87 Difference]: Start difference. First operand 3937 states and 8683 transitions. Second operand 6 states. [2019-12-07 12:51:09,958 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-07 12:51:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:10,435 INFO L93 Difference]: Finished difference Result 4383 states and 9590 transitions. [2019-12-07 12:51:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:51:10,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-07 12:51:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:10,439 INFO L225 Difference]: With dead ends: 4383 [2019-12-07 12:51:10,439 INFO L226 Difference]: Without dead ends: 4383 [2019-12-07 12:51:10,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:51:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-07 12:51:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4063. [2019-12-07 12:51:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4063 states. [2019-12-07 12:51:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 4063 states and 8938 transitions. [2019-12-07 12:51:10,474 INFO L78 Accepts]: Start accepts. Automaton has 4063 states and 8938 transitions. Word has length 94 [2019-12-07 12:51:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:10,474 INFO L462 AbstractCegarLoop]: Abstraction has 4063 states and 8938 transitions. [2019-12-07 12:51:10,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:51:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4063 states and 8938 transitions. [2019-12-07 12:51:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:10,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:10,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:10,479 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash -75332823, now seen corresponding path program 3 times [2019-12-07 12:51:10,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:10,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242947198] [2019-12-07 12:51:10,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:10,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242947198] [2019-12-07 12:51:10,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:10,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:51:10,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272385714] [2019-12-07 12:51:10,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:51:10,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:51:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:51:10,546 INFO L87 Difference]: Start difference. First operand 4063 states and 8938 transitions. Second operand 5 states. [2019-12-07 12:51:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:10,765 INFO L93 Difference]: Finished difference Result 4349 states and 9473 transitions. [2019-12-07 12:51:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:51:10,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-07 12:51:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:10,769 INFO L225 Difference]: With dead ends: 4349 [2019-12-07 12:51:10,769 INFO L226 Difference]: Without dead ends: 4349 [2019-12-07 12:51:10,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:51:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2019-12-07 12:51:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 4181. [2019-12-07 12:51:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-12-07 12:51:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 9170 transitions. [2019-12-07 12:51:10,804 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 9170 transitions. Word has length 94 [2019-12-07 12:51:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:10,804 INFO L462 AbstractCegarLoop]: Abstraction has 4181 states and 9170 transitions. [2019-12-07 12:51:10,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:51:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 9170 transitions. [2019-12-07 12:51:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:10,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:10,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:10,809 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash -391108213, now seen corresponding path program 4 times [2019-12-07 12:51:10,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:10,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34368100] [2019-12-07 12:51:10,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:10,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34368100] [2019-12-07 12:51:10,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:10,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:51:10,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869872674] [2019-12-07 12:51:10,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:51:10,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:51:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:51:10,955 INFO L87 Difference]: Start difference. First operand 4181 states and 9170 transitions. Second operand 10 states. [2019-12-07 12:51:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:11,956 INFO L93 Difference]: Finished difference Result 5958 states and 13002 transitions. [2019-12-07 12:51:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:51:11,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-12-07 12:51:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:11,962 INFO L225 Difference]: With dead ends: 5958 [2019-12-07 12:51:11,962 INFO L226 Difference]: Without dead ends: 5958 [2019-12-07 12:51:11,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:51:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2019-12-07 12:51:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 4402. [2019-12-07 12:51:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4402 states. [2019-12-07 12:51:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 9717 transitions. [2019-12-07 12:51:12,020 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 9717 transitions. Word has length 94 [2019-12-07 12:51:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:12,020 INFO L462 AbstractCegarLoop]: Abstraction has 4402 states and 9717 transitions. [2019-12-07 12:51:12,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:51:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 9717 transitions. [2019-12-07 12:51:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:12,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:12,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:12,027 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1966199233, now seen corresponding path program 5 times [2019-12-07 12:51:12,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:12,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079275542] [2019-12-07 12:51:12,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:12,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079275542] [2019-12-07 12:51:12,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:12,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:51:12,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325976846] [2019-12-07 12:51:12,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:51:12,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:12,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:51:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:12,117 INFO L87 Difference]: Start difference. First operand 4402 states and 9717 transitions. Second operand 7 states. [2019-12-07 12:51:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:12,627 INFO L93 Difference]: Finished difference Result 6324 states and 13798 transitions. [2019-12-07 12:51:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:51:12,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 12:51:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:12,632 INFO L225 Difference]: With dead ends: 6324 [2019-12-07 12:51:12,632 INFO L226 Difference]: Without dead ends: 6324 [2019-12-07 12:51:12,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:51:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2019-12-07 12:51:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 4537. [2019-12-07 12:51:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-12-07 12:51:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 10044 transitions. [2019-12-07 12:51:12,675 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 10044 transitions. Word has length 94 [2019-12-07 12:51:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:12,675 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 10044 transitions. [2019-12-07 12:51:12,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:51:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 10044 transitions. [2019-12-07 12:51:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:12,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:12,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:12,680 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash -518893889, now seen corresponding path program 6 times [2019-12-07 12:51:12,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:12,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211677875] [2019-12-07 12:51:12,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:12,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211677875] [2019-12-07 12:51:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:51:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362918220] [2019-12-07 12:51:12,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:51:12,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:51:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:12,765 INFO L87 Difference]: Start difference. First operand 4537 states and 10044 transitions. Second operand 7 states. [2019-12-07 12:51:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:13,665 INFO L93 Difference]: Finished difference Result 6419 states and 14109 transitions. [2019-12-07 12:51:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:51:13,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 12:51:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:13,673 INFO L225 Difference]: With dead ends: 6419 [2019-12-07 12:51:13,673 INFO L226 Difference]: Without dead ends: 6419 [2019-12-07 12:51:13,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:51:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2019-12-07 12:51:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 4508. [2019-12-07 12:51:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-07 12:51:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 9986 transitions. [2019-12-07 12:51:13,725 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 9986 transitions. Word has length 94 [2019-12-07 12:51:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:13,725 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 9986 transitions. [2019-12-07 12:51:13,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:51:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 9986 transitions. [2019-12-07 12:51:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:13,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:13,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:13,730 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:13,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:13,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1405936377, now seen corresponding path program 7 times [2019-12-07 12:51:13,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:13,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790081048] [2019-12-07 12:51:13,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:13,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790081048] [2019-12-07 12:51:13,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:13,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:51:13,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852358208] [2019-12-07 12:51:13,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:51:13,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:51:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:13,815 INFO L87 Difference]: Start difference. First operand 4508 states and 9986 transitions. Second operand 7 states. [2019-12-07 12:51:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:14,061 INFO L93 Difference]: Finished difference Result 4725 states and 10373 transitions. [2019-12-07 12:51:14,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:51:14,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 12:51:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:14,065 INFO L225 Difference]: With dead ends: 4725 [2019-12-07 12:51:14,065 INFO L226 Difference]: Without dead ends: 4725 [2019-12-07 12:51:14,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:51:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-07 12:51:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4514. [2019-12-07 12:51:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2019-12-07 12:51:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 9997 transitions. [2019-12-07 12:51:14,106 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 9997 transitions. Word has length 94 [2019-12-07 12:51:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:14,106 INFO L462 AbstractCegarLoop]: Abstraction has 4514 states and 9997 transitions. [2019-12-07 12:51:14,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:51:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 9997 transitions. [2019-12-07 12:51:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:14,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:14,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:14,111 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2049131019, now seen corresponding path program 8 times [2019-12-07 12:51:14,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:14,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035162065] [2019-12-07 12:51:14,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:14,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035162065] [2019-12-07 12:51:14,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:14,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:51:14,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901009802] [2019-12-07 12:51:14,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:51:14,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:51:14,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:51:14,254 INFO L87 Difference]: Start difference. First operand 4514 states and 9997 transitions. Second operand 11 states. [2019-12-07 12:51:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:15,802 INFO L93 Difference]: Finished difference Result 7215 states and 16029 transitions. [2019-12-07 12:51:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:51:15,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-07 12:51:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:15,810 INFO L225 Difference]: With dead ends: 7215 [2019-12-07 12:51:15,810 INFO L226 Difference]: Without dead ends: 7215 [2019-12-07 12:51:15,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:51:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7215 states. [2019-12-07 12:51:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7215 to 4521. [2019-12-07 12:51:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4521 states. [2019-12-07 12:51:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4521 states to 4521 states and 10012 transitions. [2019-12-07 12:51:15,975 INFO L78 Accepts]: Start accepts. Automaton has 4521 states and 10012 transitions. Word has length 94 [2019-12-07 12:51:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:15,976 INFO L462 AbstractCegarLoop]: Abstraction has 4521 states and 10012 transitions. [2019-12-07 12:51:15,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:51:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4521 states and 10012 transitions. [2019-12-07 12:51:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:51:15,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:15,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:15,981 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash -774886645, now seen corresponding path program 9 times [2019-12-07 12:51:15,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:15,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071172249] [2019-12-07 12:51:15,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:16,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071172249] [2019-12-07 12:51:16,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:16,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:51:16,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678940426] [2019-12-07 12:51:16,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:51:16,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:16,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:51:16,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:51:16,078 INFO L87 Difference]: Start difference. First operand 4521 states and 10012 transitions. Second operand 6 states. [2019-12-07 12:51:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:16,109 INFO L93 Difference]: Finished difference Result 3663 states and 7995 transitions. [2019-12-07 12:51:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:51:16,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-07 12:51:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:16,112 INFO L225 Difference]: With dead ends: 3663 [2019-12-07 12:51:16,112 INFO L226 Difference]: Without dead ends: 3663 [2019-12-07 12:51:16,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2019-12-07 12:51:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3551. [2019-12-07 12:51:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3551 states. [2019-12-07 12:51:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 7729 transitions. [2019-12-07 12:51:16,143 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 7729 transitions. Word has length 94 [2019-12-07 12:51:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:16,143 INFO L462 AbstractCegarLoop]: Abstraction has 3551 states and 7729 transitions. [2019-12-07 12:51:16,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:51:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 7729 transitions. [2019-12-07 12:51:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:51:16,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:16,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:16,148 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1088828116, now seen corresponding path program 1 times [2019-12-07 12:51:16,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:16,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160624458] [2019-12-07 12:51:16,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:16,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160624458] [2019-12-07 12:51:16,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:16,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:51:16,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959613032] [2019-12-07 12:51:16,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:51:16,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:51:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:51:16,268 INFO L87 Difference]: Start difference. First operand 3551 states and 7729 transitions. Second operand 8 states. [2019-12-07 12:51:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:17,041 INFO L93 Difference]: Finished difference Result 5430 states and 11677 transitions. [2019-12-07 12:51:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:51:17,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-07 12:51:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:17,045 INFO L225 Difference]: With dead ends: 5430 [2019-12-07 12:51:17,045 INFO L226 Difference]: Without dead ends: 5430 [2019-12-07 12:51:17,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:51:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2019-12-07 12:51:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 4551. [2019-12-07 12:51:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4551 states. [2019-12-07 12:51:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4551 states to 4551 states and 9899 transitions. [2019-12-07 12:51:17,087 INFO L78 Accepts]: Start accepts. Automaton has 4551 states and 9899 transitions. Word has length 95 [2019-12-07 12:51:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:17,087 INFO L462 AbstractCegarLoop]: Abstraction has 4551 states and 9899 transitions. [2019-12-07 12:51:17,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:51:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4551 states and 9899 transitions. [2019-12-07 12:51:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:51:17,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:17,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:17,092 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:17,092 INFO L82 PathProgramCache]: Analyzing trace with hash 143948102, now seen corresponding path program 2 times [2019-12-07 12:51:17,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:17,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295696145] [2019-12-07 12:51:17,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:17,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295696145] [2019-12-07 12:51:17,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:17,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:51:17,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293082443] [2019-12-07 12:51:17,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:51:17,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:17,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:51:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:51:17,192 INFO L87 Difference]: Start difference. First operand 4551 states and 9899 transitions. Second operand 8 states. [2019-12-07 12:51:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:17,822 INFO L93 Difference]: Finished difference Result 4986 states and 10754 transitions. [2019-12-07 12:51:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:51:17,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-07 12:51:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:17,826 INFO L225 Difference]: With dead ends: 4986 [2019-12-07 12:51:17,826 INFO L226 Difference]: Without dead ends: 4986 [2019-12-07 12:51:17,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:51:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2019-12-07 12:51:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4489. [2019-12-07 12:51:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4489 states. [2019-12-07 12:51:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 9770 transitions. [2019-12-07 12:51:17,871 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 9770 transitions. Word has length 95 [2019-12-07 12:51:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:17,871 INFO L462 AbstractCegarLoop]: Abstraction has 4489 states and 9770 transitions. [2019-12-07 12:51:17,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:51:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 9770 transitions. [2019-12-07 12:51:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:51:17,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:17,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:17,876 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1117943828, now seen corresponding path program 3 times [2019-12-07 12:51:17,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:17,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227502177] [2019-12-07 12:51:17,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:17,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227502177] [2019-12-07 12:51:17,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:17,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:51:17,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047327859] [2019-12-07 12:51:17,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:51:17,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:51:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:51:17,989 INFO L87 Difference]: Start difference. First operand 4489 states and 9770 transitions. Second operand 9 states. [2019-12-07 12:51:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:18,542 INFO L93 Difference]: Finished difference Result 5640 states and 12148 transitions. [2019-12-07 12:51:18,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:51:18,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-07 12:51:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:18,546 INFO L225 Difference]: With dead ends: 5640 [2019-12-07 12:51:18,546 INFO L226 Difference]: Without dead ends: 5640 [2019-12-07 12:51:18,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:51:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2019-12-07 12:51:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 4855. [2019-12-07 12:51:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4855 states. [2019-12-07 12:51:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 10585 transitions. [2019-12-07 12:51:18,588 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 10585 transitions. Word has length 95 [2019-12-07 12:51:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:18,588 INFO L462 AbstractCegarLoop]: Abstraction has 4855 states and 10585 transitions. [2019-12-07 12:51:18,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:51:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 10585 transitions. [2019-12-07 12:51:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:51:18,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:18,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:18,592 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:18,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:18,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1601932448, now seen corresponding path program 4 times [2019-12-07 12:51:18,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:18,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365036313] [2019-12-07 12:51:18,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:18,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365036313] [2019-12-07 12:51:18,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:18,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:51:18,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469621623] [2019-12-07 12:51:18,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:51:18,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:51:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:51:18,713 INFO L87 Difference]: Start difference. First operand 4855 states and 10585 transitions. Second operand 10 states. [2019-12-07 12:51:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:20,286 INFO L93 Difference]: Finished difference Result 5742 states and 12355 transitions. [2019-12-07 12:51:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:51:20,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-07 12:51:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:20,293 INFO L225 Difference]: With dead ends: 5742 [2019-12-07 12:51:20,293 INFO L226 Difference]: Without dead ends: 5742 [2019-12-07 12:51:20,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:51:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-12-07 12:51:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5179. [2019-12-07 12:51:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5179 states. [2019-12-07 12:51:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5179 states to 5179 states and 11281 transitions. [2019-12-07 12:51:20,353 INFO L78 Accepts]: Start accepts. Automaton has 5179 states and 11281 transitions. Word has length 95 [2019-12-07 12:51:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:20,353 INFO L462 AbstractCegarLoop]: Abstraction has 5179 states and 11281 transitions. [2019-12-07 12:51:20,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:51:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5179 states and 11281 transitions. [2019-12-07 12:51:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:51:20,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:20,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:20,356 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2076598612, now seen corresponding path program 5 times [2019-12-07 12:51:20,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:20,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125089744] [2019-12-07 12:51:20,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:20,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125089744] [2019-12-07 12:51:20,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:20,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:51:20,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559039192] [2019-12-07 12:51:20,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:51:20,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:51:20,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:51:20,532 INFO L87 Difference]: Start difference. First operand 5179 states and 11281 transitions. Second operand 12 states. [2019-12-07 12:51:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:22,483 INFO L93 Difference]: Finished difference Result 9462 states and 20606 transitions. [2019-12-07 12:51:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 12:51:22,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-12-07 12:51:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:22,489 INFO L225 Difference]: With dead ends: 9462 [2019-12-07 12:51:22,489 INFO L226 Difference]: Without dead ends: 9462 [2019-12-07 12:51:22,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1219, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 12:51:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9462 states. [2019-12-07 12:51:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9462 to 5502. [2019-12-07 12:51:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5502 states. [2019-12-07 12:51:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 12063 transitions. [2019-12-07 12:51:22,553 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 12063 transitions. Word has length 95 [2019-12-07 12:51:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:22,553 INFO L462 AbstractCegarLoop]: Abstraction has 5502 states and 12063 transitions. [2019-12-07 12:51:22,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:51:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 12063 transitions. [2019-12-07 12:51:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 12:51:22,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:22,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:22,557 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1825327703, now seen corresponding path program 1 times [2019-12-07 12:51:22,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:22,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315651602] [2019-12-07 12:51:22,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:22,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315651602] [2019-12-07 12:51:22,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:22,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:51:22,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830629299] [2019-12-07 12:51:22,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:51:22,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:51:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:51:22,689 INFO L87 Difference]: Start difference. First operand 5502 states and 12063 transitions. Second operand 10 states. [2019-12-07 12:51:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:23,339 INFO L93 Difference]: Finished difference Result 8439 states and 18354 transitions. [2019-12-07 12:51:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:51:23,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-07 12:51:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:23,343 INFO L225 Difference]: With dead ends: 8439 [2019-12-07 12:51:23,343 INFO L226 Difference]: Without dead ends: 5995 [2019-12-07 12:51:23,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:51:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2019-12-07 12:51:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 5610. [2019-12-07 12:51:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2019-12-07 12:51:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 12279 transitions. [2019-12-07 12:51:23,391 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 12279 transitions. Word has length 96 [2019-12-07 12:51:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:23,391 INFO L462 AbstractCegarLoop]: Abstraction has 5610 states and 12279 transitions. [2019-12-07 12:51:23,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:51:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 12279 transitions. [2019-12-07 12:51:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 12:51:23,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:23,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:23,395 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:23,395 INFO L82 PathProgramCache]: Analyzing trace with hash -35157433, now seen corresponding path program 2 times [2019-12-07 12:51:23,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:23,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240721049] [2019-12-07 12:51:23,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:23,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240721049] [2019-12-07 12:51:23,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:23,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:51:23,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285916727] [2019-12-07 12:51:23,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:51:23,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:23,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:51:23,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:51:23,507 INFO L87 Difference]: Start difference. First operand 5610 states and 12279 transitions. Second operand 9 states. [2019-12-07 12:51:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:24,391 INFO L93 Difference]: Finished difference Result 9555 states and 20907 transitions. [2019-12-07 12:51:24,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:51:24,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-07 12:51:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:24,397 INFO L225 Difference]: With dead ends: 9555 [2019-12-07 12:51:24,397 INFO L226 Difference]: Without dead ends: 9555 [2019-12-07 12:51:24,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:51:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2019-12-07 12:51:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 6441. [2019-12-07 12:51:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2019-12-07 12:51:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 14114 transitions. [2019-12-07 12:51:24,469 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 14114 transitions. Word has length 96 [2019-12-07 12:51:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:24,469 INFO L462 AbstractCegarLoop]: Abstraction has 6441 states and 14114 transitions. [2019-12-07 12:51:24,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:51:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 14114 transitions. [2019-12-07 12:51:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 12:51:24,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:24,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:24,474 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash -917542930, now seen corresponding path program 1 times [2019-12-07 12:51:24,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:24,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520473741] [2019-12-07 12:51:24,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:24,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520473741] [2019-12-07 12:51:24,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:24,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:51:24,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092171668] [2019-12-07 12:51:24,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:51:24,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:51:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:51:24,629 INFO L87 Difference]: Start difference. First operand 6441 states and 14114 transitions. Second operand 13 states. [2019-12-07 12:51:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:24,949 INFO L93 Difference]: Finished difference Result 9593 states and 20743 transitions. [2019-12-07 12:51:24,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:51:24,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-07 12:51:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:24,955 INFO L225 Difference]: With dead ends: 9593 [2019-12-07 12:51:24,955 INFO L226 Difference]: Without dead ends: 9495 [2019-12-07 12:51:24,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:51:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9495 states. [2019-12-07 12:51:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9495 to 6798. [2019-12-07 12:51:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2019-12-07 12:51:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 14943 transitions. [2019-12-07 12:51:25,025 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 14943 transitions. Word has length 96 [2019-12-07 12:51:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:25,026 INFO L462 AbstractCegarLoop]: Abstraction has 6798 states and 14943 transitions. [2019-12-07 12:51:25,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:51:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 14943 transitions. [2019-12-07 12:51:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:51:25,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:25,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:25,030 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash 822787398, now seen corresponding path program 1 times [2019-12-07 12:51:25,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:25,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441007881] [2019-12-07 12:51:25,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:25,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441007881] [2019-12-07 12:51:25,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:25,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:51:25,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375731594] [2019-12-07 12:51:25,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:51:25,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:51:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:51:25,258 INFO L87 Difference]: Start difference. First operand 6798 states and 14943 transitions. Second operand 14 states. [2019-12-07 12:51:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:26,803 INFO L93 Difference]: Finished difference Result 13804 states and 30386 transitions. [2019-12-07 12:51:26,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 12:51:26,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-07 12:51:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:26,809 INFO L225 Difference]: With dead ends: 13804 [2019-12-07 12:51:26,809 INFO L226 Difference]: Without dead ends: 9598 [2019-12-07 12:51:26,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:51:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2019-12-07 12:51:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 7252. [2019-12-07 12:51:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7252 states. [2019-12-07 12:51:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 15906 transitions. [2019-12-07 12:51:26,886 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 15906 transitions. Word has length 97 [2019-12-07 12:51:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:26,886 INFO L462 AbstractCegarLoop]: Abstraction has 7252 states and 15906 transitions. [2019-12-07 12:51:26,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:51:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 15906 transitions. [2019-12-07 12:51:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:51:26,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:26,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:26,892 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 683607686, now seen corresponding path program 1 times [2019-12-07 12:51:26,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:26,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590125135] [2019-12-07 12:51:26,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:26,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590125135] [2019-12-07 12:51:26,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:26,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:51:26,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128431891] [2019-12-07 12:51:26,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:51:26,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:26,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:51:26,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:51:26,946 INFO L87 Difference]: Start difference. First operand 7252 states and 15906 transitions. Second operand 6 states. [2019-12-07 12:51:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:27,195 INFO L93 Difference]: Finished difference Result 7649 states and 16614 transitions. [2019-12-07 12:51:27,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:51:27,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-07 12:51:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:27,200 INFO L225 Difference]: With dead ends: 7649 [2019-12-07 12:51:27,200 INFO L226 Difference]: Without dead ends: 7524 [2019-12-07 12:51:27,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:51:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2019-12-07 12:51:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 7219. [2019-12-07 12:51:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7219 states. [2019-12-07 12:51:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7219 states to 7219 states and 15807 transitions. [2019-12-07 12:51:27,263 INFO L78 Accepts]: Start accepts. Automaton has 7219 states and 15807 transitions. Word has length 97 [2019-12-07 12:51:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:27,263 INFO L462 AbstractCegarLoop]: Abstraction has 7219 states and 15807 transitions. [2019-12-07 12:51:27,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:51:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7219 states and 15807 transitions. [2019-12-07 12:51:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:51:27,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:27,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:27,268 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1233370852, now seen corresponding path program 2 times [2019-12-07 12:51:27,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:27,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823650308] [2019-12-07 12:51:27,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:27,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823650308] [2019-12-07 12:51:27,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:27,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 12:51:27,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929872318] [2019-12-07 12:51:27,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:51:27,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:51:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:51:27,502 INFO L87 Difference]: Start difference. First operand 7219 states and 15807 transitions. Second operand 19 states. [2019-12-07 12:51:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:28,932 INFO L93 Difference]: Finished difference Result 16234 states and 35544 transitions. [2019-12-07 12:51:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 12:51:28,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-07 12:51:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:28,943 INFO L225 Difference]: With dead ends: 16234 [2019-12-07 12:51:28,943 INFO L226 Difference]: Without dead ends: 16136 [2019-12-07 12:51:28,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 12:51:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16136 states. [2019-12-07 12:51:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16136 to 11415. [2019-12-07 12:51:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11415 states. [2019-12-07 12:51:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11415 states to 11415 states and 25389 transitions. [2019-12-07 12:51:29,075 INFO L78 Accepts]: Start accepts. Automaton has 11415 states and 25389 transitions. Word has length 97 [2019-12-07 12:51:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:29,075 INFO L462 AbstractCegarLoop]: Abstraction has 11415 states and 25389 transitions. [2019-12-07 12:51:29,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:51:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 11415 states and 25389 transitions. [2019-12-07 12:51:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:51:29,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:29,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:29,085 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:29,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash 101148117, now seen corresponding path program 1 times [2019-12-07 12:51:29,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:29,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378211912] [2019-12-07 12:51:29,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:51:29,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378211912] [2019-12-07 12:51:29,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:29,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:51:29,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430864037] [2019-12-07 12:51:29,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:51:29,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:51:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:51:29,145 INFO L87 Difference]: Start difference. First operand 11415 states and 25389 transitions. Second operand 5 states. [2019-12-07 12:51:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:29,217 INFO L93 Difference]: Finished difference Result 15990 states and 35482 transitions. [2019-12-07 12:51:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:51:29,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-07 12:51:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:29,220 INFO L225 Difference]: With dead ends: 15990 [2019-12-07 12:51:29,220 INFO L226 Difference]: Without dead ends: 5110 [2019-12-07 12:51:29,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:51:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2019-12-07 12:51:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 5110. [2019-12-07 12:51:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5110 states. [2019-12-07 12:51:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 11180 transitions. [2019-12-07 12:51:29,259 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 11180 transitions. Word has length 97 [2019-12-07 12:51:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:29,260 INFO L462 AbstractCegarLoop]: Abstraction has 5110 states and 11180 transitions. [2019-12-07 12:51:29,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:51:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 11180 transitions. [2019-12-07 12:51:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:51:29,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:29,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:29,263 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash 741591247, now seen corresponding path program 1 times [2019-12-07 12:51:29,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:29,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761054527] [2019-12-07 12:51:29,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:51:29,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-07 12:51:29,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761054527] [2019-12-07 12:51:29,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:51:29,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 12:51:29,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758143181] [2019-12-07 12:51:29,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:51:29,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:51:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:51:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:51:29,567 INFO L87 Difference]: Start difference. First operand 5110 states and 11180 transitions. Second operand 14 states. [2019-12-07 12:51:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:51:30,431 INFO L93 Difference]: Finished difference Result 8720 states and 18917 transitions. [2019-12-07 12:51:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:51:30,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-07 12:51:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:51:30,437 INFO L225 Difference]: With dead ends: 8720 [2019-12-07 12:51:30,437 INFO L226 Difference]: Without dead ends: 8636 [2019-12-07 12:51:30,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:51:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8636 states. [2019-12-07 12:51:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8636 to 6082. [2019-12-07 12:51:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2019-12-07 12:51:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 13313 transitions. [2019-12-07 12:51:30,497 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 13313 transitions. Word has length 98 [2019-12-07 12:51:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:51:30,497 INFO L462 AbstractCegarLoop]: Abstraction has 6082 states and 13313 transitions. [2019-12-07 12:51:30,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:51:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 13313 transitions. [2019-12-07 12:51:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:51:30,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:51:30,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:51:30,501 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:51:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:51:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash 402744400, now seen corresponding path program 1 times [2019-12-07 12:51:30,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:51:30,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18264455] [2019-12-07 12:51:30,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:51:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:51:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:51:30,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:51:30,605 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:51:30,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19|) |v_ULTIMATE.start_main_~#t1645~0.offset_15| 0)) |v_#memory_int_9|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff1_thd1~0_311 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1645~0.base_19| 4)) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1645~0.base_19|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 |v_ULTIMATE.start_main_~#t1645~0.offset_15|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19| 1) |v_#valid_46|) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1645~0.base=|v_ULTIMATE.start_main_~#t1645~0.base_19|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_~#t1645~0.offset=|v_ULTIMATE.start_main_~#t1645~0.offset_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_17|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1645~0.base, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t1645~0.offset, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, 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, ULTIMATE.start_main_~#t1646~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_~#t1646~0.base, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, 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, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:51:30,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1646~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1646~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1646~0.base_11| 4)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11|) |v_ULTIMATE.start_main_~#t1646~0.offset_10| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t1646~0.offset, #length, ULTIMATE.start_main_~#t1646~0.base] because there is no mapped edge [2019-12-07 12:51:30,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out188682256| |P0Thread1of1ForFork0_#t~ite3_Out188682256|)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In188682256 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In188682256 256) 0))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In188682256 |P0Thread1of1ForFork0_#t~ite3_Out188682256|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In188682256 |P0Thread1of1ForFork0_#t~ite3_Out188682256|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In188682256, ~y$w_buff1~0=~y$w_buff1~0_In188682256, ~y~0=~y~0_In188682256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In188682256} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In188682256, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out188682256|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out188682256|, ~y$w_buff1~0=~y$w_buff1~0_In188682256, ~y~0=~y~0_In188682256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In188682256} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 12:51:30,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1900139367 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1900139367 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1900139367 |P0Thread1of1ForFork0_#t~ite5_Out-1900139367|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1900139367| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1900139367, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1900139367} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1900139367|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1900139367, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1900139367} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:51:30,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-461737686 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-461737686 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-461737686 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-461737686 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-461737686| ~y$w_buff1_used~0_In-461737686)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-461737686| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-461737686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-461737686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-461737686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-461737686} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-461737686|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-461737686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-461737686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-461737686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-461737686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:51:30,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In837059342 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In837059342 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out837059342|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In837059342 |P0Thread1of1ForFork0_#t~ite7_Out837059342|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In837059342, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In837059342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In837059342, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out837059342|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In837059342} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:51:30,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-189231764 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-189231764 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-189231764 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-189231764 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-189231764| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-189231764| ~y$r_buff1_thd1~0_In-189231764) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-189231764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-189231764, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-189231764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-189231764} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-189231764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-189231764, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-189231764|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-189231764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-189231764} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:51:30,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1436528447 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite10_Out1436528447| |P0Thread1of1ForFork0_#t~ite9_Out1436528447|)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1436528447 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In1436528447 |P0Thread1of1ForFork0_#t~ite9_Out1436528447|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out1436528447| ~y$w_buff1~0_In1436528447) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1436528447, ~y$w_buff1~0=~y$w_buff1~0_In1436528447, ~y~0=~y~0_In1436528447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436528447} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out1436528447|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1436528447, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1436528447|, ~y$w_buff1~0=~y$w_buff1~0_In1436528447, ~y~0=~y~0_In1436528447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436528447} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 12:51:30,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_217 256) 0)) (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_P1Thread1of1ForFork1_~arg.base_29 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_~y$w_buff0_used~0_458 1) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31)) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_29) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_29, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:51:30,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-180209930 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-180209930 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-180209930 |P1Thread1of1ForFork1_#t~ite17_Out-180209930|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In-180209930 |P1Thread1of1ForFork1_#t~ite17_Out-180209930|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-180209930, ~y$w_buff1~0=~y$w_buff1~0_In-180209930, ~y$w_buff0~0=~y$w_buff0~0_In-180209930, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-180209930} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-180209930, ~y$w_buff1~0=~y$w_buff1~0_In-180209930, ~y$w_buff0~0=~y$w_buff0~0_In-180209930, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-180209930, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-180209930|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:51:30,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_8|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_8|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_11|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:51:30,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_12|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_8|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 12:51:30,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-205057548 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-205057548 |P1Thread1of1ForFork1_#t~ite37_Out-205057548|)) (and .cse0 (= ~y~0_In-205057548 |P1Thread1of1ForFork1_#t~ite37_Out-205057548|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-205057548, ~y$flush_delayed~0=~y$flush_delayed~0_In-205057548, ~y~0=~y~0_In-205057548} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-205057548, ~y$flush_delayed~0=~y$flush_delayed~0_In-205057548, ~y~0=~y~0_In-205057548, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-205057548|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:51:30,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1581408585 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1581408585 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite40_Out1581408585| |P1Thread1of1ForFork1_#t~ite41_Out1581408585|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite40_Out1581408585| ~y$w_buff0~0_In1581408585)) (and (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite40_Out1581408585| ~y$w_buff1~0_In1581408585) .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1581408585, ~y$w_buff1~0=~y$w_buff1~0_In1581408585, ~y$w_buff0~0=~y$w_buff0~0_In1581408585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1581408585} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1581408585, ~y$w_buff1~0=~y$w_buff1~0_In1581408585, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out1581408585|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out1581408585|, ~y$w_buff0~0=~y$w_buff0~0_In1581408585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1581408585} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 12:51:30,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_9|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_9|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_12|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:51:30,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1834325587 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite60_Out1834325587| ~y$mem_tmp~0_In1834325587)) (and .cse0 (= ~y~0_In1834325587 |P1Thread1of1ForFork1_#t~ite60_Out1834325587|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1834325587, ~y$flush_delayed~0=~y$flush_delayed~0_In1834325587, ~y~0=~y~0_In1834325587} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1834325587, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1834325587|, ~y$flush_delayed~0=~y$flush_delayed~0_In1834325587, ~y~0=~y~0_In1834325587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 12:51:30,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1301748037 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1301748037 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite63_Out1301748037|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1301748037 |P1Thread1of1ForFork1_#t~ite63_Out1301748037|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1301748037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1301748037} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out1301748037|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1301748037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1301748037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-07 12:51:30,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2116989021 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2116989021 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite11_Out2116989021|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2116989021 |P0Thread1of1ForFork0_#t~ite11_Out2116989021|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2116989021, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2116989021} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out2116989021|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116989021, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2116989021} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 12:51:30,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1016007281 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1016007281 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1016007281 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1016007281 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite64_Out1016007281|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1016007281 |P1Thread1of1ForFork1_#t~ite64_Out1016007281|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1016007281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1016007281, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1016007281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1016007281} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1016007281, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out1016007281|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1016007281, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1016007281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1016007281} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-07 12:51:30,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In661784202 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In661784202 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_Out661784202 ~y$r_buff0_thd2~0_In661784202))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out661784202 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In661784202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In661784202} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In661784202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out661784202, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out661784202|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-07 12:51:30,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In339213806 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In339213806 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In339213806 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In339213806 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In339213806 |P1Thread1of1ForFork1_#t~ite66_Out339213806|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite66_Out339213806|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In339213806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In339213806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In339213806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339213806} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In339213806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In339213806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In339213806, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out339213806|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339213806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-07 12:51:30,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:51:30,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1534784100 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1534784100 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1534784100 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1534784100 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite12_Out-1534784100| ~y$w_buff1_used~0_In-1534784100)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite12_Out-1534784100| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1534784100, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1534784100, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1534784100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1534784100} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1534784100, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1534784100, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1534784100, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1534784100|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1534784100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 12:51:30,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-52605234 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-52605234 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite13_Out-52605234| ~y$r_buff0_thd1~0_In-52605234)) (and (= |P0Thread1of1ForFork0_#t~ite13_Out-52605234| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-52605234, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52605234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-52605234, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52605234, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-52605234|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 12:51:30,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1443323768 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1443323768 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1443323768 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1443323768 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_Out1443323768| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite14_Out1443323768| ~y$r_buff1_thd1~0_In1443323768)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1443323768, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1443323768, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1443323768, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1443323768} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1443323768, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1443323768, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1443323768, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1443323768|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1443323768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 12:51:30,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_26|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_25|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 12:51:30,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_26) 1 0) 0) 0 1) v_~main$tmp_guard0~0_9)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:51:30,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In670128665 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In670128665 256)))) (or (and (= ~y~0_In670128665 |ULTIMATE.start_main_#t~ite69_Out670128665|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In670128665 |ULTIMATE.start_main_#t~ite69_Out670128665|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In670128665, ~y~0=~y~0_In670128665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In670128665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670128665} OutVars{~y$w_buff1~0=~y$w_buff1~0_In670128665, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out670128665|, ~y~0=~y~0_In670128665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In670128665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670128665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 12:51:30,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-07 12:51:30,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2017609132 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2017609132 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite71_Out-2017609132|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2017609132 |ULTIMATE.start_main_#t~ite71_Out-2017609132|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2017609132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2017609132} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-2017609132|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2017609132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2017609132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-07 12:51:30,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In799511571 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In799511571 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In799511571 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In799511571 256)))) (or (and (= |ULTIMATE.start_main_#t~ite72_Out799511571| ~y$w_buff1_used~0_In799511571) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite72_Out799511571| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In799511571, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In799511571, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In799511571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799511571} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out799511571|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799511571, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In799511571, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In799511571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799511571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 12:51:30,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In610211246 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In610211246 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite73_Out610211246| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite73_Out610211246| ~y$r_buff0_thd0~0_In610211246)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In610211246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610211246} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out610211246|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In610211246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610211246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 12:51:30,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-50619500 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-50619500 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-50619500 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-50619500 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite74_Out-50619500| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-50619500 |ULTIMATE.start_main_#t~ite74_Out-50619500|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-50619500, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-50619500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-50619500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-50619500} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-50619500|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-50619500, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-50619500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-50619500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-50619500} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 12:51:30,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1339878168 256) 0))) (or (and .cse0 (= ~y~0_In-1339878168 |ULTIMATE.start_main_#t~ite97_Out-1339878168|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1339878168 |ULTIMATE.start_main_#t~ite97_Out-1339878168|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1339878168, ~y$flush_delayed~0=~y$flush_delayed~0_In-1339878168, ~y~0=~y~0_In-1339878168} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1339878168, ~y$flush_delayed~0=~y$flush_delayed~0_In-1339878168, ~y~0=~y~0_In-1339878168, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1339878168|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 12:51:30,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 12:51:30,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:51:30 BasicIcfg [2019-12-07 12:51:30,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:51:30,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:51:30,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:51:30,695 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:51:30,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:50:43" (3/4) ... [2019-12-07 12:51:30,697 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:51:30,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19|) |v_ULTIMATE.start_main_~#t1645~0.offset_15| 0)) |v_#memory_int_9|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff1_thd1~0_311 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1645~0.base_19| 4)) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1645~0.base_19|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 |v_ULTIMATE.start_main_~#t1645~0.offset_15|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19| 1) |v_#valid_46|) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1645~0.base=|v_ULTIMATE.start_main_~#t1645~0.base_19|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_~#t1645~0.offset=|v_ULTIMATE.start_main_~#t1645~0.offset_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_17|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1645~0.base, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t1645~0.offset, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, 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, ULTIMATE.start_main_~#t1646~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_~#t1646~0.base, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, 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, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:51:30,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1646~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1646~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1646~0.base_11| 4)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11|) |v_ULTIMATE.start_main_~#t1646~0.offset_10| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t1646~0.offset, #length, ULTIMATE.start_main_~#t1646~0.base] because there is no mapped edge [2019-12-07 12:51:30,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out188682256| |P0Thread1of1ForFork0_#t~ite3_Out188682256|)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In188682256 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In188682256 256) 0))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In188682256 |P0Thread1of1ForFork0_#t~ite3_Out188682256|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In188682256 |P0Thread1of1ForFork0_#t~ite3_Out188682256|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In188682256, ~y$w_buff1~0=~y$w_buff1~0_In188682256, ~y~0=~y~0_In188682256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In188682256} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In188682256, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out188682256|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out188682256|, ~y$w_buff1~0=~y$w_buff1~0_In188682256, ~y~0=~y~0_In188682256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In188682256} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 12:51:30,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1900139367 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1900139367 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1900139367 |P0Thread1of1ForFork0_#t~ite5_Out-1900139367|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1900139367| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1900139367, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1900139367} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1900139367|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1900139367, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1900139367} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:51:30,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-461737686 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-461737686 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-461737686 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-461737686 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-461737686| ~y$w_buff1_used~0_In-461737686)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-461737686| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-461737686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-461737686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-461737686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-461737686} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-461737686|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-461737686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-461737686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-461737686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-461737686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:51:30,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In837059342 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In837059342 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out837059342|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In837059342 |P0Thread1of1ForFork0_#t~ite7_Out837059342|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In837059342, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In837059342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In837059342, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out837059342|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In837059342} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:51:30,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-189231764 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-189231764 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-189231764 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-189231764 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-189231764| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-189231764| ~y$r_buff1_thd1~0_In-189231764) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-189231764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-189231764, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-189231764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-189231764} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-189231764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-189231764, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-189231764|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-189231764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-189231764} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:51:30,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1436528447 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite10_Out1436528447| |P0Thread1of1ForFork0_#t~ite9_Out1436528447|)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1436528447 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In1436528447 |P0Thread1of1ForFork0_#t~ite9_Out1436528447|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out1436528447| ~y$w_buff1~0_In1436528447) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1436528447, ~y$w_buff1~0=~y$w_buff1~0_In1436528447, ~y~0=~y~0_In1436528447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436528447} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out1436528447|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1436528447, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1436528447|, ~y$w_buff1~0=~y$w_buff1~0_In1436528447, ~y~0=~y~0_In1436528447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1436528447} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 12:51:30,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_217 256) 0)) (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_P1Thread1of1ForFork1_~arg.base_29 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_~y$w_buff0_used~0_458 1) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31)) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_29) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_29, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:51:30,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-180209930 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-180209930 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-180209930 |P1Thread1of1ForFork1_#t~ite17_Out-180209930|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In-180209930 |P1Thread1of1ForFork1_#t~ite17_Out-180209930|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-180209930, ~y$w_buff1~0=~y$w_buff1~0_In-180209930, ~y$w_buff0~0=~y$w_buff0~0_In-180209930, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-180209930} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-180209930, ~y$w_buff1~0=~y$w_buff1~0_In-180209930, ~y$w_buff0~0=~y$w_buff0~0_In-180209930, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-180209930, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-180209930|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:51:30,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_8|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_8|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_11|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:51:30,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_12|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_8|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 12:51:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-205057548 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-205057548 |P1Thread1of1ForFork1_#t~ite37_Out-205057548|)) (and .cse0 (= ~y~0_In-205057548 |P1Thread1of1ForFork1_#t~ite37_Out-205057548|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-205057548, ~y$flush_delayed~0=~y$flush_delayed~0_In-205057548, ~y~0=~y~0_In-205057548} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-205057548, ~y$flush_delayed~0=~y$flush_delayed~0_In-205057548, ~y~0=~y~0_In-205057548, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-205057548|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:51:30,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1581408585 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1581408585 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite40_Out1581408585| |P1Thread1of1ForFork1_#t~ite41_Out1581408585|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite40_Out1581408585| ~y$w_buff0~0_In1581408585)) (and (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite40_Out1581408585| ~y$w_buff1~0_In1581408585) .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1581408585, ~y$w_buff1~0=~y$w_buff1~0_In1581408585, ~y$w_buff0~0=~y$w_buff0~0_In1581408585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1581408585} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1581408585, ~y$w_buff1~0=~y$w_buff1~0_In1581408585, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out1581408585|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out1581408585|, ~y$w_buff0~0=~y$w_buff0~0_In1581408585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1581408585} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 12:51:30,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_9|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_9|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_12|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:51:30,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1834325587 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite60_Out1834325587| ~y$mem_tmp~0_In1834325587)) (and .cse0 (= ~y~0_In1834325587 |P1Thread1of1ForFork1_#t~ite60_Out1834325587|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1834325587, ~y$flush_delayed~0=~y$flush_delayed~0_In1834325587, ~y~0=~y~0_In1834325587} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1834325587, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1834325587|, ~y$flush_delayed~0=~y$flush_delayed~0_In1834325587, ~y~0=~y~0_In1834325587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 12:51:30,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1301748037 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1301748037 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite63_Out1301748037|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1301748037 |P1Thread1of1ForFork1_#t~ite63_Out1301748037|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1301748037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1301748037} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out1301748037|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1301748037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1301748037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-07 12:51:30,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2116989021 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2116989021 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite11_Out2116989021|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2116989021 |P0Thread1of1ForFork0_#t~ite11_Out2116989021|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2116989021, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2116989021} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out2116989021|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116989021, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2116989021} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 12:51:30,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1016007281 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1016007281 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1016007281 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1016007281 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite64_Out1016007281|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1016007281 |P1Thread1of1ForFork1_#t~ite64_Out1016007281|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1016007281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1016007281, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1016007281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1016007281} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1016007281, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out1016007281|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1016007281, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1016007281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1016007281} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-07 12:51:30,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In661784202 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In661784202 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_Out661784202 ~y$r_buff0_thd2~0_In661784202))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out661784202 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In661784202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In661784202} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In661784202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out661784202, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out661784202|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-07 12:51:30,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In339213806 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In339213806 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In339213806 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In339213806 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In339213806 |P1Thread1of1ForFork1_#t~ite66_Out339213806|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite66_Out339213806|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In339213806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In339213806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In339213806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339213806} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In339213806, ~y$w_buff0_used~0=~y$w_buff0_used~0_In339213806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In339213806, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out339213806|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339213806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-07 12:51:30,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:51:30,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1534784100 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1534784100 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1534784100 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1534784100 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite12_Out-1534784100| ~y$w_buff1_used~0_In-1534784100)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite12_Out-1534784100| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1534784100, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1534784100, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1534784100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1534784100} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1534784100, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1534784100, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1534784100, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1534784100|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1534784100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 12:51:30,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-52605234 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-52605234 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite13_Out-52605234| ~y$r_buff0_thd1~0_In-52605234)) (and (= |P0Thread1of1ForFork0_#t~ite13_Out-52605234| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-52605234, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52605234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-52605234, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52605234, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-52605234|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 12:51:30,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1443323768 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1443323768 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1443323768 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1443323768 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_Out1443323768| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite14_Out1443323768| ~y$r_buff1_thd1~0_In1443323768)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1443323768, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1443323768, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1443323768, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1443323768} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1443323768, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1443323768, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1443323768, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1443323768|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1443323768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 12:51:30,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_26|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_25|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 12:51:30,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_26) 1 0) 0) 0 1) v_~main$tmp_guard0~0_9)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:51:30,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In670128665 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In670128665 256)))) (or (and (= ~y~0_In670128665 |ULTIMATE.start_main_#t~ite69_Out670128665|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In670128665 |ULTIMATE.start_main_#t~ite69_Out670128665|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In670128665, ~y~0=~y~0_In670128665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In670128665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670128665} OutVars{~y$w_buff1~0=~y$w_buff1~0_In670128665, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out670128665|, ~y~0=~y~0_In670128665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In670128665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670128665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 12:51:30,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-07 12:51:30,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2017609132 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2017609132 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite71_Out-2017609132|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2017609132 |ULTIMATE.start_main_#t~ite71_Out-2017609132|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2017609132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2017609132} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-2017609132|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2017609132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2017609132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-07 12:51:30,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In799511571 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In799511571 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In799511571 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In799511571 256)))) (or (and (= |ULTIMATE.start_main_#t~ite72_Out799511571| ~y$w_buff1_used~0_In799511571) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite72_Out799511571| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In799511571, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In799511571, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In799511571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799511571} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out799511571|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799511571, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In799511571, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In799511571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799511571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 12:51:30,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In610211246 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In610211246 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite73_Out610211246| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite73_Out610211246| ~y$r_buff0_thd0~0_In610211246)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In610211246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610211246} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out610211246|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In610211246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610211246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 12:51:30,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-50619500 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-50619500 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-50619500 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-50619500 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite74_Out-50619500| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-50619500 |ULTIMATE.start_main_#t~ite74_Out-50619500|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-50619500, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-50619500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-50619500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-50619500} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-50619500|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-50619500, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-50619500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-50619500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-50619500} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 12:51:30,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1339878168 256) 0))) (or (and .cse0 (= ~y~0_In-1339878168 |ULTIMATE.start_main_#t~ite97_Out-1339878168|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1339878168 |ULTIMATE.start_main_#t~ite97_Out-1339878168|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1339878168, ~y$flush_delayed~0=~y$flush_delayed~0_In-1339878168, ~y~0=~y~0_In-1339878168} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1339878168, ~y$flush_delayed~0=~y$flush_delayed~0_In-1339878168, ~y~0=~y~0_In-1339878168, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1339878168|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 12:51:30,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 12:51:30,780 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_37b0e980-b0b5-4dae-bb39-f1f324581d39/bin/uautomizer/witness.graphml [2019-12-07 12:51:30,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:51:30,781 INFO L168 Benchmark]: Toolchain (without parser) took 48769.42 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 934.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 12:51:30,782 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:51:30,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:51:30,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:51:30,782 INFO L168 Benchmark]: Boogie Preprocessor took 32.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:51:30,783 INFO L168 Benchmark]: RCFGBuilder took 516.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.9 MB in the end (delta: 78.3 MB). Peak memory consumption was 78.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:51:30,783 INFO L168 Benchmark]: TraceAbstraction took 47691.23 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 982.9 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 12:51:30,783 INFO L168 Benchmark]: Witness Printer took 85.26 ms. Allocated memory is still 4.2 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:51:30,784 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 516.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.9 MB in the end (delta: 78.3 MB). Peak memory consumption was 78.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47691.23 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 982.9 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 85.26 ms. Allocated memory is still 4.2 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 244 ProgramPointsBefore, 155 ProgramPointsAfterwards, 326 TransitionsBefore, 192 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 78 ConcurrentYvCompositions, 48 ChoiceCompositions, 16023 VarBasedMoverChecksPositive, 415 VarBasedMoverChecksNegative, 104 SemBasedMoverChecksPositive, 452 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 282427 CheckedPairsTotal, 142 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, 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] [L729] 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_p0_EAX=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=0, 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] [L824] FCALL, FORK 0 pthread_create(&t1646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, 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] [L729] 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) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 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 [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, 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] [L739] 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_p0_EAX=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=0, 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] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L771] 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_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L772] 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_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L772] 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)) [L773] 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_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L773] 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)) [L774] 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_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L774] 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)) [L775] 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_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L775] 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)) [L777] 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_p0_EAX=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=3, weak$$choice2=1, x=1, 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] [L777] 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)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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 = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L787] EXPR 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L787] 2 y = !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) [L788] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L788] 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)) [L789] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L789] 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)) [L790] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L790] 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)) [L791] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L791] 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)) [L793] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L793] 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)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L799] 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_p0_EAX=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=1, 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] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 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) [L801] 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 [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 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 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=1, 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] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 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 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L841] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L841] 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) [L842] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L842] 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)) [L843] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L843] 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)) [L844] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L844] 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)) [L845] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L845] 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)) [L846] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L846] 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)) [L847] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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] [L847] 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)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, 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, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.4s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10807 SDtfs, 12547 SDslu, 43104 SDs, 0 SdLazy, 23127 SolverSat, 735 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 88 SyntacticMatches, 52 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126190occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 33849 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2290 ConstructedInterpolants, 0 QuantifiedInterpolants, 906151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...