./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.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_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/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 29f714a86a33b0ea6c8fe0ee1d7a3bc5f936e62d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:22:53,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:22:53,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:22:53,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:22:53,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:22:53,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:22:53,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:22:53,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:22:53,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:22:53,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:22:53,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:22:53,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:22:53,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:22:53,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:22:53,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:22:53,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:22:53,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:22:53,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:22:53,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:22:53,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:22:53,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:22:53,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:22:53,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:22:53,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:22:53,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:22:53,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:22:53,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:22:53,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:22:53,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:22:53,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:22:53,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:22:53,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:22:53,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:22:53,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:22:53,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:22:53,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:22:53,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:22:53,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:22:53,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:22:53,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:22:53,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:22:53,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:22:53,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:22:53,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:22:53,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:22:53,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:22:53,084 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:22:53,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:22:53,084 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:22:53,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:22:53,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:22:53,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:22:53,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:22:53,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:22:53,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:22:53,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:22:53,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:22:53,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:22:53,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:22:53,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:22:53,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:22:53,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:22:53,087 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:22:53,087 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_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/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 -> 29f714a86a33b0ea6c8fe0ee1d7a3bc5f936e62d [2019-12-07 14:22:53,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:22:53,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:22:53,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:22:53,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:22:53,199 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:22:53,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i [2019-12-07 14:22:53,238 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/data/af92d06d8/9e2f358b288e4b37808228c6820bfa2c/FLAGc9b1054e4 [2019-12-07 14:22:53,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:22:53,589 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/sv-benchmarks/c/pthread-wmm/rfi000_rmo.oepc.i [2019-12-07 14:22:53,601 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/data/af92d06d8/9e2f358b288e4b37808228c6820bfa2c/FLAGc9b1054e4 [2019-12-07 14:22:53,610 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/data/af92d06d8/9e2f358b288e4b37808228c6820bfa2c [2019-12-07 14:22:53,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:22:53,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:22:53,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:22:53,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:22:53,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:22:53,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:22:53" (1/1) ... [2019-12-07 14:22:53,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75544c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:53, skipping insertion in model container [2019-12-07 14:22:53,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:22:53" (1/1) ... [2019-12-07 14:22:53,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:22:53,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:22:53,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:22:53,916 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:22:53,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:22:54,014 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:22:54,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54 WrapperNode [2019-12-07 14:22:54,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:22:54,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:22:54,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:22:54,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:22:54,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:22:54,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:22:54,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:22:54,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:22:54,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... [2019-12-07 14:22:54,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:22:54,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:22:54,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:22:54,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:22:54,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:22:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:22:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:22:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:22:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:22:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:22:54,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:22:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:22:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:22:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:22:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:22:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:22:54,135 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:22:54,611 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:22:54,611 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:22:54,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:22:54 BoogieIcfgContainer [2019-12-07 14:22:54,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:22:54,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:22:54,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:22:54,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:22:54,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:22:53" (1/3) ... [2019-12-07 14:22:54,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244bb441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:22:54, skipping insertion in model container [2019-12-07 14:22:54,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:22:54" (2/3) ... [2019-12-07 14:22:54,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244bb441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:22:54, skipping insertion in model container [2019-12-07 14:22:54,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:22:54" (3/3) ... [2019-12-07 14:22:54,619 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.oepc.i [2019-12-07 14:22:54,628 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:22:54,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:22:54,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:22:54,636 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:22:54,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:22:54,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:22:54,726 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:22:54,727 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:22:54,727 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:22:54,727 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:22:54,727 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:22:54,727 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:22:54,727 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:22:54,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:22:54,739 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-07 14:22:54,741 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 14:22:54,818 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 14:22:54,819 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:22:54,840 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 14:22:54,880 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 14:22:54,932 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 14:22:54,932 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:22:54,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 14:22:54,978 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-07 14:22:54,979 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:22:58,782 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 14:22:58,898 INFO L206 etLargeBlockEncoding]: Checked pairs total: 238871 [2019-12-07 14:22:58,898 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 14:22:58,901 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 186 transitions [2019-12-07 14:23:02,326 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55330 states. [2019-12-07 14:23:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states. [2019-12-07 14:23:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:23:02,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:02,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:23:02,333 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1316112, now seen corresponding path program 1 times [2019-12-07 14:23:02,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:02,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22000699] [2019-12-07 14:23:02,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:02,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22000699] [2019-12-07 14:23:02,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:02,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:23:02,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637630488] [2019-12-07 14:23:02,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:02,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:02,511 INFO L87 Difference]: Start difference. First operand 55330 states. Second operand 3 states. [2019-12-07 14:23:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:03,078 INFO L93 Difference]: Finished difference Result 55134 states and 195732 transitions. [2019-12-07 14:23:03,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:03,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:23:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:03,351 INFO L225 Difference]: With dead ends: 55134 [2019-12-07 14:23:03,352 INFO L226 Difference]: Without dead ends: 54186 [2019-12-07 14:23:03,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-07 14:23:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 54186. [2019-12-07 14:23:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54186 states. [2019-12-07 14:23:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54186 states to 54186 states and 192533 transitions. [2019-12-07 14:23:05,110 INFO L78 Accepts]: Start accepts. Automaton has 54186 states and 192533 transitions. Word has length 3 [2019-12-07 14:23:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:05,111 INFO L462 AbstractCegarLoop]: Abstraction has 54186 states and 192533 transitions. [2019-12-07 14:23:05,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 54186 states and 192533 transitions. [2019-12-07 14:23:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:23:05,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:05,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:05,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1209114037, now seen corresponding path program 1 times [2019-12-07 14:23:05,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:05,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421913857] [2019-12-07 14:23:05,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:05,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421913857] [2019-12-07 14:23:05,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:05,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:05,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040466208] [2019-12-07 14:23:05,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:05,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:05,185 INFO L87 Difference]: Start difference. First operand 54186 states and 192533 transitions. Second operand 4 states. [2019-12-07 14:23:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:05,863 INFO L93 Difference]: Finished difference Result 73782 states and 254483 transitions. [2019-12-07 14:23:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:05,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:23:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:06,009 INFO L225 Difference]: With dead ends: 73782 [2019-12-07 14:23:06,010 INFO L226 Difference]: Without dead ends: 73782 [2019-12-07 14:23:06,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73782 states. [2019-12-07 14:23:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73782 to 73598. [2019-12-07 14:23:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73598 states. [2019-12-07 14:23:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73598 states to 73598 states and 253973 transitions. [2019-12-07 14:23:07,953 INFO L78 Accepts]: Start accepts. Automaton has 73598 states and 253973 transitions. Word has length 11 [2019-12-07 14:23:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:07,953 INFO L462 AbstractCegarLoop]: Abstraction has 73598 states and 253973 transitions. [2019-12-07 14:23:07,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 73598 states and 253973 transitions. [2019-12-07 14:23:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:23:07,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:07,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:07,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:07,958 INFO L82 PathProgramCache]: Analyzing trace with hash 196484102, now seen corresponding path program 1 times [2019-12-07 14:23:07,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:07,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008043897] [2019-12-07 14:23:07,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:08,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008043897] [2019-12-07 14:23:08,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:08,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:08,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295042323] [2019-12-07 14:23:08,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:08,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:08,009 INFO L87 Difference]: Start difference. First operand 73598 states and 253973 transitions. Second operand 4 states. [2019-12-07 14:23:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:08,480 INFO L93 Difference]: Finished difference Result 91082 states and 310643 transitions. [2019-12-07 14:23:08,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:08,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:23:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:08,637 INFO L225 Difference]: With dead ends: 91082 [2019-12-07 14:23:08,637 INFO L226 Difference]: Without dead ends: 91082 [2019-12-07 14:23:08,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91082 states. [2019-12-07 14:23:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91082 to 84490. [2019-12-07 14:23:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84490 states. [2019-12-07 14:23:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84490 states to 84490 states and 288958 transitions. [2019-12-07 14:23:11,033 INFO L78 Accepts]: Start accepts. Automaton has 84490 states and 288958 transitions. Word has length 14 [2019-12-07 14:23:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:11,034 INFO L462 AbstractCegarLoop]: Abstraction has 84490 states and 288958 transitions. [2019-12-07 14:23:11,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 84490 states and 288958 transitions. [2019-12-07 14:23:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:23:11,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:11,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:11,040 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1667995754, now seen corresponding path program 1 times [2019-12-07 14:23:11,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:11,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463741361] [2019-12-07 14:23:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:11,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463741361] [2019-12-07 14:23:11,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:11,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:11,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7631504] [2019-12-07 14:23:11,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:11,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:11,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:11,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:11,097 INFO L87 Difference]: Start difference. First operand 84490 states and 288958 transitions. Second operand 4 states. [2019-12-07 14:23:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:11,140 INFO L93 Difference]: Finished difference Result 8514 states and 21866 transitions. [2019-12-07 14:23:11,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:11,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 14:23:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:11,147 INFO L225 Difference]: With dead ends: 8514 [2019-12-07 14:23:11,147 INFO L226 Difference]: Without dead ends: 7230 [2019-12-07 14:23:11,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-07 14:23:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7222. [2019-12-07 14:23:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2019-12-07 14:23:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 17730 transitions. [2019-12-07 14:23:11,223 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 17730 transitions. Word has length 20 [2019-12-07 14:23:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:11,223 INFO L462 AbstractCegarLoop]: Abstraction has 7222 states and 17730 transitions. [2019-12-07 14:23:11,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 17730 transitions. [2019-12-07 14:23:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:23:11,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:11,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:11,226 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1725930936, now seen corresponding path program 1 times [2019-12-07 14:23:11,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:11,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042136510] [2019-12-07 14:23:11,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:11,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042136510] [2019-12-07 14:23:11,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:11,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:11,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193594742] [2019-12-07 14:23:11,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:11,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:11,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:11,285 INFO L87 Difference]: Start difference. First operand 7222 states and 17730 transitions. Second operand 5 states. [2019-12-07 14:23:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:11,572 INFO L93 Difference]: Finished difference Result 8308 states and 20180 transitions. [2019-12-07 14:23:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:11,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 14:23:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:11,578 INFO L225 Difference]: With dead ends: 8308 [2019-12-07 14:23:11,578 INFO L226 Difference]: Without dead ends: 8308 [2019-12-07 14:23:11,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2019-12-07 14:23:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8206. [2019-12-07 14:23:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-12-07 14:23:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 19982 transitions. [2019-12-07 14:23:11,663 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 19982 transitions. Word has length 30 [2019-12-07 14:23:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:11,664 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 19982 transitions. [2019-12-07 14:23:11,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 19982 transitions. [2019-12-07 14:23:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:23:11,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:11,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:11,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1964223061, now seen corresponding path program 1 times [2019-12-07 14:23:11,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:11,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573266881] [2019-12-07 14:23:11,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:11,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573266881] [2019-12-07 14:23:11,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:11,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:11,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015680164] [2019-12-07 14:23:11,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:11,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:11,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:11,692 INFO L87 Difference]: Start difference. First operand 8206 states and 19982 transitions. Second operand 3 states. [2019-12-07 14:23:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:11,779 INFO L93 Difference]: Finished difference Result 12335 states and 28548 transitions. [2019-12-07 14:23:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:11,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 14:23:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:11,791 INFO L225 Difference]: With dead ends: 12335 [2019-12-07 14:23:11,791 INFO L226 Difference]: Without dead ends: 12335 [2019-12-07 14:23:11,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2019-12-07 14:23:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 11324. [2019-12-07 14:23:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-07 14:23:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 26462 transitions. [2019-12-07 14:23:11,912 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 26462 transitions. Word has length 31 [2019-12-07 14:23:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:11,912 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 26462 transitions. [2019-12-07 14:23:11,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 26462 transitions. [2019-12-07 14:23:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:23:11,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:11,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:11,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -71378589, now seen corresponding path program 1 times [2019-12-07 14:23:11,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:11,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473549716] [2019-12-07 14:23:11,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:11,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473549716] [2019-12-07 14:23:11,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:11,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:11,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861007535] [2019-12-07 14:23:11,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:11,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:11,967 INFO L87 Difference]: Start difference. First operand 11324 states and 26462 transitions. Second operand 5 states. [2019-12-07 14:23:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:12,270 INFO L93 Difference]: Finished difference Result 12877 states and 29790 transitions. [2019-12-07 14:23:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:12,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 14:23:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:12,280 INFO L225 Difference]: With dead ends: 12877 [2019-12-07 14:23:12,281 INFO L226 Difference]: Without dead ends: 12877 [2019-12-07 14:23:12,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-07 14:23:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 11566. [2019-12-07 14:23:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-12-07 14:23:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 27002 transitions. [2019-12-07 14:23:12,404 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 27002 transitions. Word has length 33 [2019-12-07 14:23:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:12,405 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 27002 transitions. [2019-12-07 14:23:12,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 27002 transitions. [2019-12-07 14:23:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:23:12,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:12,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:12,410 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1192698792, now seen corresponding path program 1 times [2019-12-07 14:23:12,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:12,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846721058] [2019-12-07 14:23:12,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:12,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846721058] [2019-12-07 14:23:12,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:12,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:12,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605170898] [2019-12-07 14:23:12,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:12,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:12,468 INFO L87 Difference]: Start difference. First operand 11566 states and 27002 transitions. Second operand 5 states. [2019-12-07 14:23:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:13,699 INFO L93 Difference]: Finished difference Result 13636 states and 31396 transitions. [2019-12-07 14:23:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:13,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 14:23:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:13,710 INFO L225 Difference]: With dead ends: 13636 [2019-12-07 14:23:13,710 INFO L226 Difference]: Without dead ends: 13636 [2019-12-07 14:23:13,710 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 14:23:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2019-12-07 14:23:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 12977. [2019-12-07 14:23:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12977 states. [2019-12-07 14:23:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12977 states to 12977 states and 30047 transitions. [2019-12-07 14:23:13,848 INFO L78 Accepts]: Start accepts. Automaton has 12977 states and 30047 transitions. Word has length 42 [2019-12-07 14:23:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:13,848 INFO L462 AbstractCegarLoop]: Abstraction has 12977 states and 30047 transitions. [2019-12-07 14:23:13,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12977 states and 30047 transitions. [2019-12-07 14:23:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:23:13,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:13,855 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] [2019-12-07 14:23:13,855 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1557518893, now seen corresponding path program 1 times [2019-12-07 14:23:13,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:13,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485475156] [2019-12-07 14:23:13,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:13,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485475156] [2019-12-07 14:23:13,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:13,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:13,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195915278] [2019-12-07 14:23:13,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:13,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:13,926 INFO L87 Difference]: Start difference. First operand 12977 states and 30047 transitions. Second operand 6 states. [2019-12-07 14:23:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:14,354 INFO L93 Difference]: Finished difference Result 15092 states and 34415 transitions. [2019-12-07 14:23:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:23:14,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 14:23:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:14,367 INFO L225 Difference]: With dead ends: 15092 [2019-12-07 14:23:14,367 INFO L226 Difference]: Without dead ends: 15067 [2019-12-07 14:23:14,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15067 states. [2019-12-07 14:23:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15067 to 14148. [2019-12-07 14:23:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-07 14:23:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 32608 transitions. [2019-12-07 14:23:14,554 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 32608 transitions. Word has length 43 [2019-12-07 14:23:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:14,554 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 32608 transitions. [2019-12-07 14:23:14,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 32608 transitions. [2019-12-07 14:23:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:23:14,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:14,560 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] [2019-12-07 14:23:14,560 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -112938140, now seen corresponding path program 1 times [2019-12-07 14:23:14,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:14,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019330069] [2019-12-07 14:23:14,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:14,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019330069] [2019-12-07 14:23:14,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:14,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:14,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415984565] [2019-12-07 14:23:14,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:14,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:14,632 INFO L87 Difference]: Start difference. First operand 14148 states and 32608 transitions. Second operand 5 states. [2019-12-07 14:23:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:14,741 INFO L93 Difference]: Finished difference Result 14521 states and 33453 transitions. [2019-12-07 14:23:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:14,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 14:23:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:14,752 INFO L225 Difference]: With dead ends: 14521 [2019-12-07 14:23:14,752 INFO L226 Difference]: Without dead ends: 14097 [2019-12-07 14:23:14,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2019-12-07 14:23:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 13840. [2019-12-07 14:23:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13840 states. [2019-12-07 14:23:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13840 states to 13840 states and 31714 transitions. [2019-12-07 14:23:14,900 INFO L78 Accepts]: Start accepts. Automaton has 13840 states and 31714 transitions. Word has length 43 [2019-12-07 14:23:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:14,900 INFO L462 AbstractCegarLoop]: Abstraction has 13840 states and 31714 transitions. [2019-12-07 14:23:14,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 13840 states and 31714 transitions. [2019-12-07 14:23:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:23:14,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:14,908 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] [2019-12-07 14:23:14,908 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1777006862, now seen corresponding path program 1 times [2019-12-07 14:23:14,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:14,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337991029] [2019-12-07 14:23:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:14,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337991029] [2019-12-07 14:23:14,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:14,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:14,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388700083] [2019-12-07 14:23:14,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:14,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:14,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:14,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:14,934 INFO L87 Difference]: Start difference. First operand 13840 states and 31714 transitions. Second operand 3 states. [2019-12-07 14:23:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:15,021 INFO L93 Difference]: Finished difference Result 15384 states and 33090 transitions. [2019-12-07 14:23:15,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:15,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 14:23:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:15,033 INFO L225 Difference]: With dead ends: 15384 [2019-12-07 14:23:15,033 INFO L226 Difference]: Without dead ends: 15384 [2019-12-07 14:23:15,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15384 states. [2019-12-07 14:23:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15384 to 14319. [2019-12-07 14:23:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14319 states. [2019-12-07 14:23:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14319 states to 14319 states and 30932 transitions. [2019-12-07 14:23:15,188 INFO L78 Accepts]: Start accepts. Automaton has 14319 states and 30932 transitions. Word has length 46 [2019-12-07 14:23:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:15,188 INFO L462 AbstractCegarLoop]: Abstraction has 14319 states and 30932 transitions. [2019-12-07 14:23:15,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 14319 states and 30932 transitions. [2019-12-07 14:23:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:23:15,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:15,197 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] [2019-12-07 14:23:15,198 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash -753849587, now seen corresponding path program 1 times [2019-12-07 14:23:15,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:15,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253621349] [2019-12-07 14:23:15,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:15,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253621349] [2019-12-07 14:23:15,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:15,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:15,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003566839] [2019-12-07 14:23:15,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:15,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:15,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:15,277 INFO L87 Difference]: Start difference. First operand 14319 states and 30932 transitions. Second operand 6 states. [2019-12-07 14:23:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:15,678 INFO L93 Difference]: Finished difference Result 15515 states and 33219 transitions. [2019-12-07 14:23:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:23:15,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 14:23:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:15,689 INFO L225 Difference]: With dead ends: 15515 [2019-12-07 14:23:15,689 INFO L226 Difference]: Without dead ends: 15447 [2019-12-07 14:23:15,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-12-07 14:23:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 13739. [2019-12-07 14:23:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13739 states. [2019-12-07 14:23:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13739 states to 13739 states and 29737 transitions. [2019-12-07 14:23:15,831 INFO L78 Accepts]: Start accepts. Automaton has 13739 states and 29737 transitions. Word has length 49 [2019-12-07 14:23:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:15,831 INFO L462 AbstractCegarLoop]: Abstraction has 13739 states and 29737 transitions. [2019-12-07 14:23:15,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13739 states and 29737 transitions. [2019-12-07 14:23:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:23:15,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:15,842 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] [2019-12-07 14:23:15,842 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1658446064, now seen corresponding path program 1 times [2019-12-07 14:23:15,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:15,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893624861] [2019-12-07 14:23:15,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:16,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893624861] [2019-12-07 14:23:16,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:16,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:23:16,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727029481] [2019-12-07 14:23:16,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:23:16,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:23:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:23:16,030 INFO L87 Difference]: Start difference. First operand 13739 states and 29737 transitions. Second operand 10 states. [2019-12-07 14:23:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:17,362 INFO L93 Difference]: Finished difference Result 20115 states and 42626 transitions. [2019-12-07 14:23:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:23:17,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 14:23:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:17,381 INFO L225 Difference]: With dead ends: 20115 [2019-12-07 14:23:17,381 INFO L226 Difference]: Without dead ends: 20115 [2019-12-07 14:23:17,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:23:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20115 states. [2019-12-07 14:23:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20115 to 16100. [2019-12-07 14:23:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2019-12-07 14:23:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 34628 transitions. [2019-12-07 14:23:17,566 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 34628 transitions. Word has length 55 [2019-12-07 14:23:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:17,567 INFO L462 AbstractCegarLoop]: Abstraction has 16100 states and 34628 transitions. [2019-12-07 14:23:17,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:23:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 34628 transitions. [2019-12-07 14:23:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 14:23:17,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:17,581 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] [2019-12-07 14:23:17,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash -45948464, now seen corresponding path program 1 times [2019-12-07 14:23:17,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:17,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650485203] [2019-12-07 14:23:17,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:17,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650485203] [2019-12-07 14:23:17,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:17,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:17,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166359135] [2019-12-07 14:23:17,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:17,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:17,641 INFO L87 Difference]: Start difference. First operand 16100 states and 34628 transitions. Second operand 5 states. [2019-12-07 14:23:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:17,674 INFO L93 Difference]: Finished difference Result 3852 states and 7665 transitions. [2019-12-07 14:23:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:17,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-07 14:23:17,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:17,677 INFO L225 Difference]: With dead ends: 3852 [2019-12-07 14:23:17,677 INFO L226 Difference]: Without dead ends: 3519 [2019-12-07 14:23:17,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2019-12-07 14:23:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3212. [2019-12-07 14:23:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2019-12-07 14:23:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 6421 transitions. [2019-12-07 14:23:17,706 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 6421 transitions. Word has length 61 [2019-12-07 14:23:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:17,706 INFO L462 AbstractCegarLoop]: Abstraction has 3212 states and 6421 transitions. [2019-12-07 14:23:17,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 6421 transitions. [2019-12-07 14:23:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:23:17,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:17,710 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] [2019-12-07 14:23:17,710 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash -253914571, now seen corresponding path program 1 times [2019-12-07 14:23:17,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:17,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536320301] [2019-12-07 14:23:17,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:17,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536320301] [2019-12-07 14:23:17,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:17,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:17,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618616145] [2019-12-07 14:23:17,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:17,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:17,784 INFO L87 Difference]: Start difference. First operand 3212 states and 6421 transitions. Second operand 5 states. [2019-12-07 14:23:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:17,896 INFO L93 Difference]: Finished difference Result 4594 states and 9233 transitions. [2019-12-07 14:23:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:17,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-07 14:23:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:17,899 INFO L225 Difference]: With dead ends: 4594 [2019-12-07 14:23:17,899 INFO L226 Difference]: Without dead ends: 4594 [2019-12-07 14:23:17,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-12-07 14:23:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4035. [2019-12-07 14:23:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4035 states. [2019-12-07 14:23:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 8172 transitions. [2019-12-07 14:23:17,930 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 8172 transitions. Word has length 85 [2019-12-07 14:23:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:17,930 INFO L462 AbstractCegarLoop]: Abstraction has 4035 states and 8172 transitions. [2019-12-07 14:23:17,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 8172 transitions. [2019-12-07 14:23:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:23:17,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:17,934 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] [2019-12-07 14:23:17,935 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash -963574665, now seen corresponding path program 1 times [2019-12-07 14:23:17,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:17,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429224462] [2019-12-07 14:23:17,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:18,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429224462] [2019-12-07 14:23:18,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:18,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:23:18,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684758404] [2019-12-07 14:23:18,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:23:18,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:18,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:23:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:23:18,016 INFO L87 Difference]: Start difference. First operand 4035 states and 8172 transitions. Second operand 8 states. [2019-12-07 14:23:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:18,788 INFO L93 Difference]: Finished difference Result 5237 states and 10445 transitions. [2019-12-07 14:23:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:23:18,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-07 14:23:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:18,792 INFO L225 Difference]: With dead ends: 5237 [2019-12-07 14:23:18,792 INFO L226 Difference]: Without dead ends: 5237 [2019-12-07 14:23:18,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:23:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2019-12-07 14:23:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 4108. [2019-12-07 14:23:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2019-12-07 14:23:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 8317 transitions. [2019-12-07 14:23:18,828 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 8317 transitions. Word has length 86 [2019-12-07 14:23:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:18,828 INFO L462 AbstractCegarLoop]: Abstraction has 4108 states and 8317 transitions. [2019-12-07 14:23:18,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:23:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 8317 transitions. [2019-12-07 14:23:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:23:18,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:18,831 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] [2019-12-07 14:23:18,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1311447091, now seen corresponding path program 2 times [2019-12-07 14:23:18,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:18,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958781503] [2019-12-07 14:23:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:18,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958781503] [2019-12-07 14:23:18,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:18,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:23:18,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312770810] [2019-12-07 14:23:18,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:23:18,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:23:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:18,934 INFO L87 Difference]: Start difference. First operand 4108 states and 8317 transitions. Second operand 9 states. [2019-12-07 14:23:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:19,533 INFO L93 Difference]: Finished difference Result 14725 states and 29622 transitions. [2019-12-07 14:23:19,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:23:19,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 14:23:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:19,540 INFO L225 Difference]: With dead ends: 14725 [2019-12-07 14:23:19,540 INFO L226 Difference]: Without dead ends: 11598 [2019-12-07 14:23:19,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:23:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11598 states. [2019-12-07 14:23:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11598 to 4227. [2019-12-07 14:23:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4227 states. [2019-12-07 14:23:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4227 states to 4227 states and 8526 transitions. [2019-12-07 14:23:19,601 INFO L78 Accepts]: Start accepts. Automaton has 4227 states and 8526 transitions. Word has length 86 [2019-12-07 14:23:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:19,601 INFO L462 AbstractCegarLoop]: Abstraction has 4227 states and 8526 transitions. [2019-12-07 14:23:19,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:23:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 8526 transitions. [2019-12-07 14:23:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:23:19,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:19,604 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] [2019-12-07 14:23:19,604 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1447020425, now seen corresponding path program 3 times [2019-12-07 14:23:19,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:19,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36803374] [2019-12-07 14:23:19,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:19,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36803374] [2019-12-07 14:23:19,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:19,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:23:19,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028402992] [2019-12-07 14:23:19,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:23:19,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:23:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:23:19,710 INFO L87 Difference]: Start difference. First operand 4227 states and 8526 transitions. Second operand 9 states. [2019-12-07 14:23:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:20,280 INFO L93 Difference]: Finished difference Result 12371 states and 24761 transitions. [2019-12-07 14:23:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:23:20,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 14:23:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:20,286 INFO L225 Difference]: With dead ends: 12371 [2019-12-07 14:23:20,286 INFO L226 Difference]: Without dead ends: 9522 [2019-12-07 14:23:20,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:23:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9522 states. [2019-12-07 14:23:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9522 to 4597. [2019-12-07 14:23:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4597 states. [2019-12-07 14:23:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 9232 transitions. [2019-12-07 14:23:20,343 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 9232 transitions. Word has length 86 [2019-12-07 14:23:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:20,343 INFO L462 AbstractCegarLoop]: Abstraction has 4597 states and 9232 transitions. [2019-12-07 14:23:20,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:23:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 9232 transitions. [2019-12-07 14:23:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:23:20,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:20,347 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] [2019-12-07 14:23:20,347 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1202316937, now seen corresponding path program 4 times [2019-12-07 14:23:20,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:20,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747453332] [2019-12-07 14:23:20,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:20,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747453332] [2019-12-07 14:23:20,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:20,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:23:20,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078545320] [2019-12-07 14:23:20,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:23:20,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:20,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:23:20,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:20,536 INFO L87 Difference]: Start difference. First operand 4597 states and 9232 transitions. Second operand 12 states. [2019-12-07 14:23:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:21,695 INFO L93 Difference]: Finished difference Result 7209 states and 14122 transitions. [2019-12-07 14:23:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:23:21,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-12-07 14:23:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:21,700 INFO L225 Difference]: With dead ends: 7209 [2019-12-07 14:23:21,700 INFO L226 Difference]: Without dead ends: 7197 [2019-12-07 14:23:21,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:23:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7197 states. [2019-12-07 14:23:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7197 to 4776. [2019-12-07 14:23:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4776 states. [2019-12-07 14:23:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 9515 transitions. [2019-12-07 14:23:21,758 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 9515 transitions. Word has length 86 [2019-12-07 14:23:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:21,758 INFO L462 AbstractCegarLoop]: Abstraction has 4776 states and 9515 transitions. [2019-12-07 14:23:21,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:23:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 9515 transitions. [2019-12-07 14:23:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:23:21,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:21,762 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] [2019-12-07 14:23:21,762 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 538011113, now seen corresponding path program 5 times [2019-12-07 14:23:21,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:21,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339012805] [2019-12-07 14:23:21,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:21,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339012805] [2019-12-07 14:23:21,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:21,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:21,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856715233] [2019-12-07 14:23:21,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:21,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:21,834 INFO L87 Difference]: Start difference. First operand 4776 states and 9515 transitions. Second operand 5 states. [2019-12-07 14:23:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:21,906 INFO L93 Difference]: Finished difference Result 7723 states and 15320 transitions. [2019-12-07 14:23:21,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:21,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-07 14:23:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:21,909 INFO L225 Difference]: With dead ends: 7723 [2019-12-07 14:23:21,909 INFO L226 Difference]: Without dead ends: 2994 [2019-12-07 14:23:21,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-07 14:23:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2836. [2019-12-07 14:23:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-12-07 14:23:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 5595 transitions. [2019-12-07 14:23:21,944 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 5595 transitions. Word has length 86 [2019-12-07 14:23:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:21,944 INFO L462 AbstractCegarLoop]: Abstraction has 2836 states and 5595 transitions. [2019-12-07 14:23:21,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 5595 transitions. [2019-12-07 14:23:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:23:21,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:21,947 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] [2019-12-07 14:23:21,947 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash 157860683, now seen corresponding path program 6 times [2019-12-07 14:23:21,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:21,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31137708] [2019-12-07 14:23:21,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:21,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31137708] [2019-12-07 14:23:21,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:21,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:21,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609906961] [2019-12-07 14:23:21,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:21,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:21,993 INFO L87 Difference]: Start difference. First operand 2836 states and 5595 transitions. Second operand 3 states. [2019-12-07 14:23:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:22,029 INFO L93 Difference]: Finished difference Result 2835 states and 5593 transitions. [2019-12-07 14:23:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:22,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 14:23:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:22,032 INFO L225 Difference]: With dead ends: 2835 [2019-12-07 14:23:22,032 INFO L226 Difference]: Without dead ends: 2835 [2019-12-07 14:23:22,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-12-07 14:23:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2500. [2019-12-07 14:23:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-12-07 14:23:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4960 transitions. [2019-12-07 14:23:22,063 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4960 transitions. Word has length 86 [2019-12-07 14:23:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:22,063 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 4960 transitions. [2019-12-07 14:23:22,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4960 transitions. [2019-12-07 14:23:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:22,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:22,066 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] [2019-12-07 14:23:22,066 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash -768002551, now seen corresponding path program 1 times [2019-12-07 14:23:22,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:22,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995142145] [2019-12-07 14:23:22,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:22,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995142145] [2019-12-07 14:23:22,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:22,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 14:23:22,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627798170] [2019-12-07 14:23:22,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:23:22,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:23:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:23:22,338 INFO L87 Difference]: Start difference. First operand 2500 states and 4960 transitions. Second operand 19 states. [2019-12-07 14:23:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:24,112 INFO L93 Difference]: Finished difference Result 6832 states and 13544 transitions. [2019-12-07 14:23:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:23:24,114 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2019-12-07 14:23:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:24,128 INFO L225 Difference]: With dead ends: 6832 [2019-12-07 14:23:24,128 INFO L226 Difference]: Without dead ends: 6793 [2019-12-07 14:23:24,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:23:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2019-12-07 14:23:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 4594. [2019-12-07 14:23:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2019-12-07 14:23:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 9164 transitions. [2019-12-07 14:23:24,202 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 9164 transitions. Word has length 87 [2019-12-07 14:23:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,202 INFO L462 AbstractCegarLoop]: Abstraction has 4594 states and 9164 transitions. [2019-12-07 14:23:24,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:23:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 9164 transitions. [2019-12-07 14:23:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:23:24,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,206 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] [2019-12-07 14:23:24,206 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash 927908343, now seen corresponding path program 2 times [2019-12-07 14:23:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:24,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694622431] [2019-12-07 14:23:24,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:23:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:23:24,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:23:24,310 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:23:24,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1593~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22|)) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22|) |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_19|, ULTIMATE.start_main_~#t1593~0.offset=|v_ULTIMATE.start_main_~#t1593~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ULTIMATE.start_main_~#t1593~0.base=|v_ULTIMATE.start_main_~#t1593~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_~#t1594~0.offset, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1593~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1593~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:23:24,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1594~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1594~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10|) |v_ULTIMATE.start_main_~#t1594~0.offset_9| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1594~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1594~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 14:23:24,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:23:24,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1680520911 256)))) (or (and .cse0 (= ~y~0_In1680520911 |P1Thread1of1ForFork1_#t~ite31_Out1680520911|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out1680520911| ~y$mem_tmp~0_In1680520911) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1680520911, ~y$flush_delayed~0=~y$flush_delayed~0_In1680520911, ~y~0=~y~0_In1680520911} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1680520911, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1680520911|, ~y$flush_delayed~0=~y$flush_delayed~0_In1680520911, ~y~0=~y~0_In1680520911} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:23:24,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In591194125 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In591194125 |P1Thread1of1ForFork1_#t~ite54_Out591194125|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out591194125| ~y~0_In591194125)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In591194125, ~y$flush_delayed~0=~y$flush_delayed~0_In591194125, ~y~0=~y~0_In591194125} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In591194125, ~y$flush_delayed~0=~y$flush_delayed~0_In591194125, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out591194125|, ~y~0=~y~0_In591194125} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 14:23:24,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1223232345 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1223232345 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1223232345| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1223232345| ~y$w_buff0_used~0_In1223232345)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1223232345, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1223232345} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1223232345|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1223232345, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1223232345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:23:24,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2135752706 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2135752706 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2135752706 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In2135752706 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2135752706 |P0Thread1of1ForFork0_#t~ite6_Out2135752706|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2135752706|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2135752706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135752706, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135752706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135752706} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2135752706|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2135752706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135752706, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135752706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135752706} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:23:24,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2075430698 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out2075430698 ~y$r_buff0_thd1~0_In2075430698)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2075430698 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out2075430698) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2075430698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2075430698} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2075430698, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2075430698|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2075430698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:23:24,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1164476264 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1164476264 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1164476264 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1164476264 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-1164476264 |P0Thread1of1ForFork0_#t~ite8_Out-1164476264|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1164476264|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1164476264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1164476264, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1164476264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1164476264} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1164476264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1164476264, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1164476264|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1164476264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1164476264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:23:24,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:23:24,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1894667894 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite56_Out1894667894| |P1Thread1of1ForFork1_#t~ite55_Out1894667894|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1894667894 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1894667894 |P1Thread1of1ForFork1_#t~ite55_Out1894667894|)) (and (not .cse1) .cse0 (= ~y$w_buff1~0_In1894667894 |P1Thread1of1ForFork1_#t~ite55_Out1894667894|) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894667894, ~y$w_buff1~0=~y$w_buff1~0_In1894667894, ~y~0=~y~0_In1894667894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894667894} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894667894, ~y$w_buff1~0=~y$w_buff1~0_In1894667894, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out1894667894|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out1894667894|, ~y~0=~y~0_In1894667894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894667894} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 14:23:24,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1069882754 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1069882754 256)))) (or (and (= ~y$w_buff0_used~0_In-1069882754 |P1Thread1of1ForFork1_#t~ite57_Out-1069882754|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out-1069882754|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1069882754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1069882754} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1069882754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1069882754, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-1069882754|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 14:23:24,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In955754023 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In955754023 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In955754023 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In955754023 256) 0))) (or (and (= ~y$w_buff1_used~0_In955754023 |P1Thread1of1ForFork1_#t~ite58_Out955754023|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out955754023|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In955754023, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955754023, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In955754023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955754023} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In955754023, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955754023, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In955754023, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out955754023|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955754023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 14:23:24,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-420895726 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-420895726 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite59_Out-420895726| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-420895726 |P1Thread1of1ForFork1_#t~ite59_Out-420895726|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-420895726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-420895726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-420895726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-420895726, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-420895726|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 14:23:24,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1554071917 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1554071917 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1554071917 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1554071917 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out1554071917| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite60_Out1554071917| ~y$r_buff1_thd2~0_In1554071917) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1554071917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1554071917, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1554071917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1554071917} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1554071917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1554071917, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1554071917|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1554071917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1554071917} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 14:23:24,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:23:24,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:23:24,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-278110274 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-278110274 256)))) (or (and (= ~y~0_In-278110274 |ULTIMATE.start_main_#t~ite63_Out-278110274|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-278110274 |ULTIMATE.start_main_#t~ite63_Out-278110274|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-278110274, ~y~0=~y~0_In-278110274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-278110274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-278110274} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-278110274|, ~y$w_buff1~0=~y$w_buff1~0_In-278110274, ~y~0=~y~0_In-278110274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-278110274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-278110274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:23:24,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:23:24,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1821943402 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1821943402 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out1821943402| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1821943402 |ULTIMATE.start_main_#t~ite65_Out1821943402|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1821943402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1821943402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1821943402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1821943402, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1821943402|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 14:23:24,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-634688915 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-634688915 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-634688915 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-634688915 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out-634688915|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-634688915 |ULTIMATE.start_main_#t~ite66_Out-634688915|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-634688915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-634688915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-634688915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-634688915} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-634688915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-634688915, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-634688915|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-634688915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-634688915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 14:23:24,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1647834245 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1647834245 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1647834245|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-1647834245| ~y$r_buff0_thd0~0_In-1647834245) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647834245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1647834245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647834245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1647834245, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1647834245|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 14:23:24,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In369643498 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In369643498 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In369643498 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In369643498 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out369643498| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out369643498| ~y$r_buff1_thd0~0_In369643498)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In369643498, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In369643498, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In369643498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369643498} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In369643498, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In369643498, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out369643498|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In369643498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369643498} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:23:24,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1503221446 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1503221446| ~y$mem_tmp~0_In1503221446) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite91_Out1503221446| ~y~0_In1503221446) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1503221446, ~y$flush_delayed~0=~y$flush_delayed~0_In1503221446, ~y~0=~y~0_In1503221446} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1503221446, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1503221446|, ~y$flush_delayed~0=~y$flush_delayed~0_In1503221446, ~y~0=~y~0_In1503221446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 14:23:24,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:23:24,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:23:24 BasicIcfg [2019-12-07 14:23:24,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:23:24,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:23:24,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:23:24,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:23:24,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:22:54" (3/4) ... [2019-12-07 14:23:24,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:23:24,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1593~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22|)) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22|) |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_19|, ULTIMATE.start_main_~#t1593~0.offset=|v_ULTIMATE.start_main_~#t1593~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ULTIMATE.start_main_~#t1593~0.base=|v_ULTIMATE.start_main_~#t1593~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_~#t1594~0.offset, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1593~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1593~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:23:24,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1594~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1594~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10|) |v_ULTIMATE.start_main_~#t1594~0.offset_9| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1594~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1594~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 14:23:24,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:23:24,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1680520911 256)))) (or (and .cse0 (= ~y~0_In1680520911 |P1Thread1of1ForFork1_#t~ite31_Out1680520911|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out1680520911| ~y$mem_tmp~0_In1680520911) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1680520911, ~y$flush_delayed~0=~y$flush_delayed~0_In1680520911, ~y~0=~y~0_In1680520911} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1680520911, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1680520911|, ~y$flush_delayed~0=~y$flush_delayed~0_In1680520911, ~y~0=~y~0_In1680520911} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:23:24,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In591194125 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In591194125 |P1Thread1of1ForFork1_#t~ite54_Out591194125|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out591194125| ~y~0_In591194125)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In591194125, ~y$flush_delayed~0=~y$flush_delayed~0_In591194125, ~y~0=~y~0_In591194125} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In591194125, ~y$flush_delayed~0=~y$flush_delayed~0_In591194125, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out591194125|, ~y~0=~y~0_In591194125} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 14:23:24,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1223232345 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1223232345 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1223232345| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1223232345| ~y$w_buff0_used~0_In1223232345)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1223232345, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1223232345} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1223232345|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1223232345, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1223232345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:23:24,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2135752706 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2135752706 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2135752706 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In2135752706 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2135752706 |P0Thread1of1ForFork0_#t~ite6_Out2135752706|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2135752706|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2135752706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135752706, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135752706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135752706} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2135752706|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2135752706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135752706, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135752706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135752706} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:23:24,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2075430698 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out2075430698 ~y$r_buff0_thd1~0_In2075430698)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2075430698 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out2075430698) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2075430698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2075430698} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2075430698, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2075430698|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2075430698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:23:24,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1164476264 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1164476264 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1164476264 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1164476264 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-1164476264 |P0Thread1of1ForFork0_#t~ite8_Out-1164476264|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1164476264|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1164476264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1164476264, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1164476264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1164476264} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1164476264, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1164476264, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1164476264|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1164476264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1164476264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:23:24,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:23:24,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1894667894 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite56_Out1894667894| |P1Thread1of1ForFork1_#t~ite55_Out1894667894|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1894667894 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1894667894 |P1Thread1of1ForFork1_#t~ite55_Out1894667894|)) (and (not .cse1) .cse0 (= ~y$w_buff1~0_In1894667894 |P1Thread1of1ForFork1_#t~ite55_Out1894667894|) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894667894, ~y$w_buff1~0=~y$w_buff1~0_In1894667894, ~y~0=~y~0_In1894667894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894667894} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894667894, ~y$w_buff1~0=~y$w_buff1~0_In1894667894, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out1894667894|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out1894667894|, ~y~0=~y~0_In1894667894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894667894} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 14:23:24,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1069882754 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1069882754 256)))) (or (and (= ~y$w_buff0_used~0_In-1069882754 |P1Thread1of1ForFork1_#t~ite57_Out-1069882754|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out-1069882754|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1069882754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1069882754} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1069882754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1069882754, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-1069882754|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 14:23:24,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In955754023 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In955754023 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In955754023 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In955754023 256) 0))) (or (and (= ~y$w_buff1_used~0_In955754023 |P1Thread1of1ForFork1_#t~ite58_Out955754023|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out955754023|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In955754023, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955754023, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In955754023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955754023} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In955754023, ~y$w_buff0_used~0=~y$w_buff0_used~0_In955754023, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In955754023, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out955754023|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In955754023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 14:23:24,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-420895726 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-420895726 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite59_Out-420895726| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-420895726 |P1Thread1of1ForFork1_#t~ite59_Out-420895726|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-420895726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-420895726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-420895726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-420895726, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-420895726|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 14:23:24,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1554071917 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1554071917 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1554071917 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1554071917 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out1554071917| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite60_Out1554071917| ~y$r_buff1_thd2~0_In1554071917) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1554071917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1554071917, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1554071917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1554071917} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1554071917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1554071917, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1554071917|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1554071917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1554071917} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 14:23:24,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:23:24,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:23:24,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-278110274 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-278110274 256)))) (or (and (= ~y~0_In-278110274 |ULTIMATE.start_main_#t~ite63_Out-278110274|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-278110274 |ULTIMATE.start_main_#t~ite63_Out-278110274|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-278110274, ~y~0=~y~0_In-278110274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-278110274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-278110274} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-278110274|, ~y$w_buff1~0=~y$w_buff1~0_In-278110274, ~y~0=~y~0_In-278110274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-278110274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-278110274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:23:24,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:23:24,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1821943402 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1821943402 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out1821943402| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1821943402 |ULTIMATE.start_main_#t~ite65_Out1821943402|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1821943402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1821943402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1821943402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1821943402, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1821943402|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 14:23:24,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-634688915 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-634688915 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-634688915 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-634688915 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out-634688915|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-634688915 |ULTIMATE.start_main_#t~ite66_Out-634688915|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-634688915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-634688915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-634688915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-634688915} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-634688915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-634688915, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-634688915|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-634688915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-634688915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 14:23:24,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1647834245 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1647834245 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1647834245|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-1647834245| ~y$r_buff0_thd0~0_In-1647834245) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647834245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1647834245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1647834245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1647834245, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1647834245|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 14:23:24,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In369643498 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In369643498 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In369643498 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In369643498 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out369643498| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out369643498| ~y$r_buff1_thd0~0_In369643498)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In369643498, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In369643498, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In369643498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369643498} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In369643498, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In369643498, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out369643498|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In369643498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369643498} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:23:24,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1503221446 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1503221446| ~y$mem_tmp~0_In1503221446) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite91_Out1503221446| ~y~0_In1503221446) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1503221446, ~y$flush_delayed~0=~y$flush_delayed~0_In1503221446, ~y~0=~y~0_In1503221446} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1503221446, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1503221446|, ~y$flush_delayed~0=~y$flush_delayed~0_In1503221446, ~y~0=~y~0_In1503221446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 14:23:24,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:23:24,507 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_567b86ef-f3c8-4e73-a5a3-9e167acd74d8/bin/uautomizer/witness.graphml [2019-12-07 14:23:24,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:23:24,508 INFO L168 Benchmark]: Toolchain (without parser) took 30895.60 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 938.1 MB in the beginning and 545.5 MB in the end (delta: 392.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 14:23:24,509 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:24,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -104.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:24,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:24,509 INFO L168 Benchmark]: Boogie Preprocessor took 30.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:24,510 INFO L168 Benchmark]: RCFGBuilder took 523.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 963.7 MB in the end (delta: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:24,510 INFO L168 Benchmark]: TraceAbstraction took 29793.63 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 963.7 MB in the beginning and 593.9 MB in the end (delta: 369.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 14:23:24,510 INFO L168 Benchmark]: Witness Printer took 100.06 ms. Allocated memory is still 3.0 GB. Free memory was 593.9 MB in the beginning and 545.5 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:24,512 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -104.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 523.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 963.7 MB in the end (delta: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29793.63 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 963.7 MB in the beginning and 593.9 MB in the end (delta: 369.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 100.06 ms. Allocated memory is still 3.0 GB. Free memory was 593.9 MB in the beginning and 545.5 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 231 ProgramPointsBefore, 150 ProgramPointsAfterwards, 307 TransitionsBefore, 186 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 69 ConcurrentYvCompositions, 43 ChoiceCompositions, 14826 VarBasedMoverChecksPositive, 421 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 422 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 238871 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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 [!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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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 [!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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.5s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8415 SDtfs, 6975 SDslu, 29527 SDs, 0 SdLazy, 11646 SolverSat, 381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84490occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 37235 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1256 NumberOfCodeBlocks, 1256 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 395355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...