./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/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 9630ca7d719382fab52804caadf6e5a04f286707 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:50:41,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:50:41,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:50:41,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:50:41,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:50:41,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:50:41,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:50:41,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:50:41,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:50:41,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:50:41,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:50:41,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:50:41,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:50:41,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:50:41,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:50:41,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:50:41,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:50:41,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:50:41,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:50:41,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:50:41,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:50:41,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:50:41,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:50:41,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:50:41,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:50:41,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:50:41,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:50:41,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:50:41,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:50:41,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:50:41,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:50:41,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:50:41,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:50:41,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:50:41,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:50:41,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:50:41,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:50:41,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:50:41,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:50:41,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:50:41,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:50:41,062 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:50:41,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:50:41,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:50:41,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:50:41,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:50:41,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:50:41,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:50:41,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:50:41,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:50:41,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:50:41,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:50:41,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:50:41,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:50:41,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:50:41,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:50:41,074 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_941b8ba9-ad8a-4828-ae84-03810837639d/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 -> 9630ca7d719382fab52804caadf6e5a04f286707 [2019-12-07 18:50:41,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:50:41,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:50:41,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:50:41,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:50:41,183 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:50:41,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix018_rmo.opt.i [2019-12-07 18:50:41,220 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/data/ce1700be1/7c725bc622324c638c675a1a0f73a0a8/FLAGde180fff3 [2019-12-07 18:50:41,615 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:50:41,615 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/sv-benchmarks/c/pthread-wmm/mix018_rmo.opt.i [2019-12-07 18:50:41,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/data/ce1700be1/7c725bc622324c638c675a1a0f73a0a8/FLAGde180fff3 [2019-12-07 18:50:41,638 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/data/ce1700be1/7c725bc622324c638c675a1a0f73a0a8 [2019-12-07 18:50:41,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:50:41,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:50:41,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:50:41,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:50:41,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:50:41,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:50:41" (1/1) ... [2019-12-07 18:50:41,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:41, skipping insertion in model container [2019-12-07 18:50:41,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:50:41" (1/1) ... [2019-12-07 18:50:41,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:50:41,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:50:41,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:50:41,959 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:50:42,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:50:42,054 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:50:42,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42 WrapperNode [2019-12-07 18:50:42,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:50:42,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:50:42,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:50:42,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:50:42,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:50:42,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:50:42,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:50:42,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:50:42,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... [2019-12-07 18:50:42,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:50:42,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:50:42,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:50:42,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:50:42,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/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 18:50:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:50:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:50:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:50:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:50:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:50:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:50:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:50:42,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:50:42,176 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 18:50:42,595 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:50:42,595 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:50:42,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:42 BoogieIcfgContainer [2019-12-07 18:50:42,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:50:42,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:50:42,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:50:42,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:50:42,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:50:41" (1/3) ... [2019-12-07 18:50:42,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93fac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:50:42, skipping insertion in model container [2019-12-07 18:50:42,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:42" (2/3) ... [2019-12-07 18:50:42,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93fac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:50:42, skipping insertion in model container [2019-12-07 18:50:42,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:42" (3/3) ... [2019-12-07 18:50:42,601 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_rmo.opt.i [2019-12-07 18:50:42,607 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:50:42,607 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:50:42,612 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:50:42,612 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:50:42,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,664 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,665 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,666 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,672 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:50:42,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:50:42,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:50:42,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:50:42,696 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:50:42,696 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:50:42,696 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:50:42,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:50:42,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:50:42,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:50:42,711 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 18:50:42,713 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:50:42,797 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:50:42,797 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:50:42,809 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:50:42,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:50:42,871 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:50:42,872 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:50:42,881 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:50:42,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 18:50:42,908 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:50:46,616 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:50:46,917 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:50:47,027 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 18:50:47,027 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 18:50:47,029 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 18:50:55,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 18:50:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 18:50:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:50:55,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:55,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:55,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:50:55,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 18:50:55,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:55,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590674013] [2019-12-07 18:50:55,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:55,683 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 18:50:55,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590674013] [2019-12-07 18:50:55,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:55,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:50:55,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346467481] [2019-12-07 18:50:55,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:50:55,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:50:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:50:55,698 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 18:50:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:56,318 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 18:50:56,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:50:56,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:50:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:56,842 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 18:50:56,842 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 18:50:56,843 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 18:50:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 18:50:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 18:50:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 18:51:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 18:51:00,148 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 18:51:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:00,150 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 18:51:00,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:51:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 18:51:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:51:00,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:00,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:51:00,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 18:51:00,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:00,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623112986] [2019-12-07 18:51:00,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:00,219 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 18:51:00,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623112986] [2019-12-07 18:51:00,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:00,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:51:00,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021829718] [2019-12-07 18:51:00,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:51:00,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:51:00,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:51:00,221 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 18:51:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:51:01,106 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 18:51:01,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:51:01,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:51:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:51:03,433 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 18:51:03,433 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 18:51:03,434 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 18:51:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 18:51:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 18:51:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 18:51:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 18:51:07,436 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 18:51:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:07,436 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 18:51:07,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:51:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 18:51:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:51:07,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:07,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:51:07,443 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 18:51:07,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:07,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375684853] [2019-12-07 18:51:07,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:07,488 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 18:51:07,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375684853] [2019-12-07 18:51:07,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:07,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:51:07,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931792754] [2019-12-07 18:51:07,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:51:07,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:51:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:51:07,490 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 18:51:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:51:08,376 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 18:51:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:51:08,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:51:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:51:08,809 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 18:51:08,810 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 18:51:08,810 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 18:51:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 18:51:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 18:51:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 18:51:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 18:51:15,201 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 18:51:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:15,201 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 18:51:15,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:51:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 18:51:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:51:15,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:15,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:51:15,211 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 18:51:15,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:15,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827686668] [2019-12-07 18:51:15,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:15,247 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 18:51:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827686668] [2019-12-07 18:51:15,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:15,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:51:15,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842095005] [2019-12-07 18:51:15,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:51:15,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:51:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:51:15,248 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 18:51:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:51:16,748 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 18:51:16,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:51:16,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:51:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:51:17,461 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 18:51:17,461 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 18:51:17,462 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 18:51:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 18:51:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 18:51:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 18:51:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 18:51:26,366 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 18:51:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:26,366 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 18:51:26,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:51:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 18:51:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:51:26,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:26,381 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 18:51:26,381 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 18:51:26,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:26,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206941862] [2019-12-07 18:51:26,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:26,421 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 18:51:26,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206941862] [2019-12-07 18:51:26,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:26,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:51:26,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026281011] [2019-12-07 18:51:26,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:51:26,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:51:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:51:26,423 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 18:51:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:51:27,838 INFO L93 Difference]: Finished difference Result 207942 states and 891892 transitions. [2019-12-07 18:51:27,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:51:27,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:51:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:51:28,431 INFO L225 Difference]: With dead ends: 207942 [2019-12-07 18:51:28,431 INFO L226 Difference]: Without dead ends: 207942 [2019-12-07 18:51:28,432 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 18:51:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207942 states. [2019-12-07 18:51:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207942 to 205878. [2019-12-07 18:51:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205878 states. [2019-12-07 18:51:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205878 states to 205878 states and 883844 transitions. [2019-12-07 18:51:38,084 INFO L78 Accepts]: Start accepts. Automaton has 205878 states and 883844 transitions. Word has length 20 [2019-12-07 18:51:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:38,084 INFO L462 AbstractCegarLoop]: Abstraction has 205878 states and 883844 transitions. [2019-12-07 18:51:38,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:51:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 205878 states and 883844 transitions. [2019-12-07 18:51:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:51:38,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:38,095 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 18:51:38,095 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:38,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:38,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1422939487, now seen corresponding path program 1 times [2019-12-07 18:51:38,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:38,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778360566] [2019-12-07 18:51:38,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:38,169 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 18:51:38,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778360566] [2019-12-07 18:51:38,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:51:38,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895292845] [2019-12-07 18:51:38,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:51:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:51:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:51:38,171 INFO L87 Difference]: Start difference. First operand 205878 states and 883844 transitions. Second operand 3 states. [2019-12-07 18:51:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:51:39,407 INFO L93 Difference]: Finished difference Result 271349 states and 1099719 transitions. [2019-12-07 18:51:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:51:39,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:51:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:51:40,139 INFO L225 Difference]: With dead ends: 271349 [2019-12-07 18:51:40,139 INFO L226 Difference]: Without dead ends: 270911 [2019-12-07 18:51:40,139 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 18:51:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270911 states. [2019-12-07 18:51:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270911 to 264871. [2019-12-07 18:51:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264871 states. [2019-12-07 18:51:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264871 states to 264871 states and 1082715 transitions. [2019-12-07 18:51:48,152 INFO L78 Accepts]: Start accepts. Automaton has 264871 states and 1082715 transitions. Word has length 20 [2019-12-07 18:51:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:48,152 INFO L462 AbstractCegarLoop]: Abstraction has 264871 states and 1082715 transitions. [2019-12-07 18:51:48,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:51:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 264871 states and 1082715 transitions. [2019-12-07 18:51:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:51:48,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:48,166 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] [2019-12-07 18:51:48,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:48,167 INFO L82 PathProgramCache]: Analyzing trace with hash -346227298, now seen corresponding path program 1 times [2019-12-07 18:51:48,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:48,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291095362] [2019-12-07 18:51:48,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:48,207 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 18:51:48,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291095362] [2019-12-07 18:51:48,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:48,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:51:48,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178286118] [2019-12-07 18:51:48,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:51:48,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:48,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:51:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:51:48,209 INFO L87 Difference]: Start difference. First operand 264871 states and 1082715 transitions. Second operand 3 states. [2019-12-07 18:51:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:51:49,387 INFO L93 Difference]: Finished difference Result 258275 states and 1056589 transitions. [2019-12-07 18:51:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:51:49,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 18:51:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:51:50,066 INFO L225 Difference]: With dead ends: 258275 [2019-12-07 18:51:50,066 INFO L226 Difference]: Without dead ends: 258275 [2019-12-07 18:51:50,067 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 18:51:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258275 states. [2019-12-07 18:51:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258275 to 221554. [2019-12-07 18:51:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221554 states. [2019-12-07 18:51:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221554 states to 221554 states and 931574 transitions. [2019-12-07 18:51:59,813 INFO L78 Accepts]: Start accepts. Automaton has 221554 states and 931574 transitions. Word has length 21 [2019-12-07 18:51:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:51:59,814 INFO L462 AbstractCegarLoop]: Abstraction has 221554 states and 931574 transitions. [2019-12-07 18:51:59,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:51:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 221554 states and 931574 transitions. [2019-12-07 18:51:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:51:59,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:51:59,827 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] [2019-12-07 18:51:59,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:51:59,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:51:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 18:51:59,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:51:59,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894624618] [2019-12-07 18:51:59,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:51:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:51:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:51:59,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894624618] [2019-12-07 18:51:59,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:51:59,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:51:59,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190880928] [2019-12-07 18:51:59,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:51:59,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:51:59,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:51:59,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:51:59,866 INFO L87 Difference]: Start difference. First operand 221554 states and 931574 transitions. Second operand 4 states. [2019-12-07 18:52:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:01,783 INFO L93 Difference]: Finished difference Result 275045 states and 1145051 transitions. [2019-12-07 18:52:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:01,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:52:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:02,496 INFO L225 Difference]: With dead ends: 275045 [2019-12-07 18:52:02,496 INFO L226 Difference]: Without dead ends: 274977 [2019-12-07 18:52:02,496 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 18:52:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274977 states. [2019-12-07 18:52:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274977 to 225042. [2019-12-07 18:52:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225042 states. [2019-12-07 18:52:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225042 states to 225042 states and 945884 transitions. [2019-12-07 18:52:09,299 INFO L78 Accepts]: Start accepts. Automaton has 225042 states and 945884 transitions. Word has length 21 [2019-12-07 18:52:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:09,300 INFO L462 AbstractCegarLoop]: Abstraction has 225042 states and 945884 transitions. [2019-12-07 18:52:09,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 225042 states and 945884 transitions. [2019-12-07 18:52:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:52:09,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:09,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:09,332 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 18:52:09,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:09,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603916661] [2019-12-07 18:52:09,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:09,371 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 18:52:09,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603916661] [2019-12-07 18:52:09,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:09,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:09,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075252046] [2019-12-07 18:52:09,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:09,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:09,373 INFO L87 Difference]: Start difference. First operand 225042 states and 945884 transitions. Second operand 5 states. [2019-12-07 18:52:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:11,643 INFO L93 Difference]: Finished difference Result 319033 states and 1317689 transitions. [2019-12-07 18:52:11,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:52:11,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 18:52:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:15,608 INFO L225 Difference]: With dead ends: 319033 [2019-12-07 18:52:15,608 INFO L226 Difference]: Without dead ends: 318977 [2019-12-07 18:52:15,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318977 states. [2019-12-07 18:52:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318977 to 242837. [2019-12-07 18:52:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242837 states. [2019-12-07 18:52:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242837 states to 242837 states and 1018616 transitions. [2019-12-07 18:52:22,720 INFO L78 Accepts]: Start accepts. Automaton has 242837 states and 1018616 transitions. Word has length 24 [2019-12-07 18:52:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:22,720 INFO L462 AbstractCegarLoop]: Abstraction has 242837 states and 1018616 transitions. [2019-12-07 18:52:22,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 242837 states and 1018616 transitions. [2019-12-07 18:52:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:52:22,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:22,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:22,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1719472782, now seen corresponding path program 1 times [2019-12-07 18:52:22,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:22,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983828817] [2019-12-07 18:52:22,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:22,822 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 18:52:22,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983828817] [2019-12-07 18:52:22,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:22,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:22,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940583995] [2019-12-07 18:52:22,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:22,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:22,823 INFO L87 Difference]: Start difference. First operand 242837 states and 1018616 transitions. Second operand 5 states. [2019-12-07 18:52:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:25,182 INFO L93 Difference]: Finished difference Result 330671 states and 1365544 transitions. [2019-12-07 18:52:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:52:25,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:52:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:26,585 INFO L225 Difference]: With dead ends: 330671 [2019-12-07 18:52:26,585 INFO L226 Difference]: Without dead ends: 330559 [2019-12-07 18:52:26,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330559 states. [2019-12-07 18:52:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330559 to 229610. [2019-12-07 18:52:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229610 states. [2019-12-07 18:52:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229610 states to 229610 states and 963320 transitions. [2019-12-07 18:52:33,855 INFO L78 Accepts]: Start accepts. Automaton has 229610 states and 963320 transitions. Word has length 27 [2019-12-07 18:52:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:33,856 INFO L462 AbstractCegarLoop]: Abstraction has 229610 states and 963320 transitions. [2019-12-07 18:52:33,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 229610 states and 963320 transitions. [2019-12-07 18:52:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:52:34,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:34,050 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] [2019-12-07 18:52:34,050 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 262911733, now seen corresponding path program 1 times [2019-12-07 18:52:34,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:34,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491881300] [2019-12-07 18:52:34,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:34,102 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 18:52:34,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491881300] [2019-12-07 18:52:34,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:34,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:34,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180902211] [2019-12-07 18:52:34,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:34,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:34,105 INFO L87 Difference]: Start difference. First operand 229610 states and 963320 transitions. Second operand 4 states. [2019-12-07 18:52:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:35,671 INFO L93 Difference]: Finished difference Result 268059 states and 1089512 transitions. [2019-12-07 18:52:35,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:35,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 18:52:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:36,386 INFO L225 Difference]: With dead ends: 268059 [2019-12-07 18:52:36,386 INFO L226 Difference]: Without dead ends: 268059 [2019-12-07 18:52:36,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268059 states. [2019-12-07 18:52:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268059 to 228274. [2019-12-07 18:52:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228274 states. [2019-12-07 18:52:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228274 states to 228274 states and 956382 transitions. [2019-12-07 18:52:45,711 INFO L78 Accepts]: Start accepts. Automaton has 228274 states and 956382 transitions. Word has length 35 [2019-12-07 18:52:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:45,711 INFO L462 AbstractCegarLoop]: Abstraction has 228274 states and 956382 transitions. [2019-12-07 18:52:45,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 228274 states and 956382 transitions. [2019-12-07 18:52:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:52:45,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:45,910 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] [2019-12-07 18:52:45,910 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1013939211, now seen corresponding path program 1 times [2019-12-07 18:52:45,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:45,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580725672] [2019-12-07 18:52:45,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:45,975 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 18:52:45,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580725672] [2019-12-07 18:52:45,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:45,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:45,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622527858] [2019-12-07 18:52:45,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:45,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:45,976 INFO L87 Difference]: Start difference. First operand 228274 states and 956382 transitions. Second operand 4 states. [2019-12-07 18:52:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:47,692 INFO L93 Difference]: Finished difference Result 277255 states and 1114196 transitions. [2019-12-07 18:52:47,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:47,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 18:52:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:48,229 INFO L225 Difference]: With dead ends: 277255 [2019-12-07 18:52:48,230 INFO L226 Difference]: Without dead ends: 214325 [2019-12-07 18:52:48,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214325 states. [2019-12-07 18:52:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214325 to 198602. [2019-12-07 18:52:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198602 states. [2019-12-07 18:52:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198602 states to 198602 states and 798763 transitions. [2019-12-07 18:52:54,509 INFO L78 Accepts]: Start accepts. Automaton has 198602 states and 798763 transitions. Word has length 36 [2019-12-07 18:52:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:54,509 INFO L462 AbstractCegarLoop]: Abstraction has 198602 states and 798763 transitions. [2019-12-07 18:52:54,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 198602 states and 798763 transitions. [2019-12-07 18:52:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:52:54,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:54,695 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] [2019-12-07 18:52:54,695 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1981311576, now seen corresponding path program 1 times [2019-12-07 18:52:54,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:54,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870218314] [2019-12-07 18:52:54,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:54,769 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 18:52:54,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870218314] [2019-12-07 18:52:54,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:54,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:52:54,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896920469] [2019-12-07 18:52:54,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:52:54,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:54,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:52:54,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:54,770 INFO L87 Difference]: Start difference. First operand 198602 states and 798763 transitions. Second operand 9 states. [2019-12-07 18:52:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:58,046 INFO L93 Difference]: Finished difference Result 518856 states and 2093664 transitions. [2019-12-07 18:52:58,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:52:58,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 18:52:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:59,184 INFO L225 Difference]: With dead ends: 518856 [2019-12-07 18:52:59,184 INFO L226 Difference]: Without dead ends: 422648 [2019-12-07 18:52:59,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:53:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422648 states. [2019-12-07 18:53:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422648 to 322646. [2019-12-07 18:53:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322646 states. [2019-12-07 18:53:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322646 states to 322646 states and 1308048 transitions. [2019-12-07 18:53:11,867 INFO L78 Accepts]: Start accepts. Automaton has 322646 states and 1308048 transitions. Word has length 36 [2019-12-07 18:53:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:11,867 INFO L462 AbstractCegarLoop]: Abstraction has 322646 states and 1308048 transitions. [2019-12-07 18:53:11,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:53:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 322646 states and 1308048 transitions. [2019-12-07 18:53:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:53:12,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:12,254 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] [2019-12-07 18:53:12,254 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:12,255 INFO L82 PathProgramCache]: Analyzing trace with hash 262926389, now seen corresponding path program 1 times [2019-12-07 18:53:12,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:12,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855523123] [2019-12-07 18:53:12,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:12,310 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 18:53:12,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855523123] [2019-12-07 18:53:12,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:12,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:53:12,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599192552] [2019-12-07 18:53:12,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:53:12,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:53:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:12,312 INFO L87 Difference]: Start difference. First operand 322646 states and 1308048 transitions. Second operand 5 states. [2019-12-07 18:53:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:12,771 INFO L93 Difference]: Finished difference Result 120745 states and 411271 transitions. [2019-12-07 18:53:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:12,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 18:53:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:12,956 INFO L225 Difference]: With dead ends: 120745 [2019-12-07 18:53:12,957 INFO L226 Difference]: Without dead ends: 100753 [2019-12-07 18:53:12,957 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 18:53:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100753 states. [2019-12-07 18:53:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100753 to 100282. [2019-12-07 18:53:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100282 states. [2019-12-07 18:53:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100282 states to 100282 states and 331601 transitions. [2019-12-07 18:53:15,349 INFO L78 Accepts]: Start accepts. Automaton has 100282 states and 331601 transitions. Word has length 37 [2019-12-07 18:53:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:15,349 INFO L462 AbstractCegarLoop]: Abstraction has 100282 states and 331601 transitions. [2019-12-07 18:53:15,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:53:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 100282 states and 331601 transitions. [2019-12-07 18:53:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:53:15,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:15,431 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] [2019-12-07 18:53:15,431 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash 445827019, now seen corresponding path program 1 times [2019-12-07 18:53:15,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:15,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219159920] [2019-12-07 18:53:15,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:15,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219159920] [2019-12-07 18:53:15,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:15,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:53:15,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404783213] [2019-12-07 18:53:15,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:53:15,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:15,490 INFO L87 Difference]: Start difference. First operand 100282 states and 331601 transitions. Second operand 6 states. [2019-12-07 18:53:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:15,615 INFO L93 Difference]: Finished difference Result 27357 states and 86443 transitions. [2019-12-07 18:53:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:53:15,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 18:53:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:15,644 INFO L225 Difference]: With dead ends: 27357 [2019-12-07 18:53:15,644 INFO L226 Difference]: Without dead ends: 21974 [2019-12-07 18:53:15,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:53:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21974 states. [2019-12-07 18:53:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21974 to 20433. [2019-12-07 18:53:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20433 states. [2019-12-07 18:53:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 63149 transitions. [2019-12-07 18:53:16,210 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 63149 transitions. Word has length 38 [2019-12-07 18:53:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:16,210 INFO L462 AbstractCegarLoop]: Abstraction has 20433 states and 63149 transitions. [2019-12-07 18:53:16,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:53:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 63149 transitions. [2019-12-07 18:53:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:53:16,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:16,230 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 18:53:16,230 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash 951052415, now seen corresponding path program 1 times [2019-12-07 18:53:16,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:16,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935875] [2019-12-07 18:53:16,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:16,306 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 18:53:16,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935875] [2019-12-07 18:53:16,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:16,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:53:16,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379917050] [2019-12-07 18:53:16,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:53:16,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:53:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:16,307 INFO L87 Difference]: Start difference. First operand 20433 states and 63149 transitions. Second operand 7 states. [2019-12-07 18:53:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:16,418 INFO L93 Difference]: Finished difference Result 18472 states and 58723 transitions. [2019-12-07 18:53:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:53:16,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 18:53:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:16,438 INFO L225 Difference]: With dead ends: 18472 [2019-12-07 18:53:16,438 INFO L226 Difference]: Without dead ends: 13809 [2019-12-07 18:53:16,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:53:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-07 18:53:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13425. [2019-12-07 18:53:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-12-07 18:53:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 41772 transitions. [2019-12-07 18:53:16,616 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 41772 transitions. Word has length 49 [2019-12-07 18:53:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:16,616 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 41772 transitions. [2019-12-07 18:53:16,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:53:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 41772 transitions. [2019-12-07 18:53:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:53:16,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:16,630 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] [2019-12-07 18:53:16,630 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1029868635, now seen corresponding path program 1 times [2019-12-07 18:53:16,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:16,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229767709] [2019-12-07 18:53:16,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:16,692 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 18:53:16,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229767709] [2019-12-07 18:53:16,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:16,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:16,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014013418] [2019-12-07 18:53:16,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:16,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:16,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:16,693 INFO L87 Difference]: Start difference. First operand 13425 states and 41772 transitions. Second operand 4 states. [2019-12-07 18:53:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:16,755 INFO L93 Difference]: Finished difference Result 14802 states and 45340 transitions. [2019-12-07 18:53:16,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:16,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:53:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:16,772 INFO L225 Difference]: With dead ends: 14802 [2019-12-07 18:53:16,772 INFO L226 Difference]: Without dead ends: 13345 [2019-12-07 18:53:16,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:53:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13345 states. [2019-12-07 18:53:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13345 to 12015. [2019-12-07 18:53:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-07 18:53:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 36829 transitions. [2019-12-07 18:53:16,929 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 36829 transitions. Word has length 65 [2019-12-07 18:53:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:16,929 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 36829 transitions. [2019-12-07 18:53:16,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 36829 transitions. [2019-12-07 18:53:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:53:16,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:16,940 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] [2019-12-07 18:53:16,941 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1486943137, now seen corresponding path program 2 times [2019-12-07 18:53:16,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:16,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162669681] [2019-12-07 18:53:16,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:16,986 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 18:53:16,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162669681] [2019-12-07 18:53:16,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:16,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:16,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996972311] [2019-12-07 18:53:16,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:16,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:16,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:16,988 INFO L87 Difference]: Start difference. First operand 12015 states and 36829 transitions. Second operand 4 states. [2019-12-07 18:53:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:17,030 INFO L93 Difference]: Finished difference Result 13592 states and 41167 transitions. [2019-12-07 18:53:17,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:17,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:53:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:17,037 INFO L225 Difference]: With dead ends: 13592 [2019-12-07 18:53:17,037 INFO L226 Difference]: Without dead ends: 6051 [2019-12-07 18:53:17,037 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 18:53:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2019-12-07 18:53:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 6051. [2019-12-07 18:53:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6051 states. [2019-12-07 18:53:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6051 states to 6051 states and 16064 transitions. [2019-12-07 18:53:17,102 INFO L78 Accepts]: Start accepts. Automaton has 6051 states and 16064 transitions. Word has length 65 [2019-12-07 18:53:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:17,102 INFO L462 AbstractCegarLoop]: Abstraction has 6051 states and 16064 transitions. [2019-12-07 18:53:17,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 6051 states and 16064 transitions. [2019-12-07 18:53:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:53:17,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:17,106 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] [2019-12-07 18:53:17,106 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash -505309043, now seen corresponding path program 3 times [2019-12-07 18:53:17,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:17,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143106039] [2019-12-07 18:53:17,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:17,179 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 18:53:17,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143106039] [2019-12-07 18:53:17,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:17,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:17,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529712096] [2019-12-07 18:53:17,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:17,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:17,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:17,180 INFO L87 Difference]: Start difference. First operand 6051 states and 16064 transitions. Second operand 4 states. [2019-12-07 18:53:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:17,215 INFO L93 Difference]: Finished difference Result 6563 states and 17221 transitions. [2019-12-07 18:53:17,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:17,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:53:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:17,220 INFO L225 Difference]: With dead ends: 6563 [2019-12-07 18:53:17,220 INFO L226 Difference]: Without dead ends: 4998 [2019-12-07 18:53:17,220 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 18:53:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-07 18:53:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4569. [2019-12-07 18:53:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4569 states. [2019-12-07 18:53:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 12315 transitions. [2019-12-07 18:53:17,269 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 12315 transitions. Word has length 65 [2019-12-07 18:53:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:17,269 INFO L462 AbstractCegarLoop]: Abstraction has 4569 states and 12315 transitions. [2019-12-07 18:53:17,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 12315 transitions. [2019-12-07 18:53:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:53:17,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:17,273 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] [2019-12-07 18:53:17,273 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -396636243, now seen corresponding path program 4 times [2019-12-07 18:53:17,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:17,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906466181] [2019-12-07 18:53:17,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:17,347 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 18:53:17,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906466181] [2019-12-07 18:53:17,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:17,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:53:17,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605163896] [2019-12-07 18:53:17,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:53:17,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:53:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:17,348 INFO L87 Difference]: Start difference. First operand 4569 states and 12315 transitions. Second operand 7 states. [2019-12-07 18:53:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:17,507 INFO L93 Difference]: Finished difference Result 9755 states and 26618 transitions. [2019-12-07 18:53:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:53:17,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 18:53:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:17,515 INFO L225 Difference]: With dead ends: 9755 [2019-12-07 18:53:17,516 INFO L226 Difference]: Without dead ends: 6024 [2019-12-07 18:53:17,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:53:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-12-07 18:53:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4598. [2019-12-07 18:53:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4598 states. [2019-12-07 18:53:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 12323 transitions. [2019-12-07 18:53:17,575 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 12323 transitions. Word has length 65 [2019-12-07 18:53:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:17,575 INFO L462 AbstractCegarLoop]: Abstraction has 4598 states and 12323 transitions. [2019-12-07 18:53:17,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:53:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 12323 transitions. [2019-12-07 18:53:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:53:17,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:17,578 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] [2019-12-07 18:53:17,579 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1473700222, now seen corresponding path program 1 times [2019-12-07 18:53:17,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:17,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799793177] [2019-12-07 18:53:17,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:17,756 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 18:53:17,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799793177] [2019-12-07 18:53:17,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:17,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:53:17,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836514908] [2019-12-07 18:53:17,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:53:17,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:53:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:53:17,757 INFO L87 Difference]: Start difference. First operand 4598 states and 12323 transitions. Second operand 12 states. [2019-12-07 18:53:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:18,532 INFO L93 Difference]: Finished difference Result 6204 states and 16229 transitions. [2019-12-07 18:53:18,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:53:18,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 18:53:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:18,533 INFO L225 Difference]: With dead ends: 6204 [2019-12-07 18:53:18,533 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 18:53:18,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:53:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 18:53:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 18:53:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 18:53:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 18:53:18,538 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 66 [2019-12-07 18:53:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:18,538 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 18:53:18,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:53:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 18:53:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:53:18,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:18,539 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] [2019-12-07 18:53:18,539 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 2 times [2019-12-07 18:53:18,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:18,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819714436] [2019-12-07 18:53:18,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:18,606 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 18:53:18,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819714436] [2019-12-07 18:53:18,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:18,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:53:18,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929925004] [2019-12-07 18:53:18,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:53:18,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:53:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:18,607 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 18:53:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:18,796 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 18:53:18,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:53:18,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 18:53:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:18,797 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 18:53:18,797 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 18:53:18,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:53:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 18:53:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 18:53:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 18:53:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 18:53:18,802 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 18:53:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:18,803 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 18:53:18,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:53:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 18:53:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:53:18,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:18,803 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] [2019-12-07 18:53:18,803 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 3 times [2019-12-07 18:53:18,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:18,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836979054] [2019-12-07 18:53:18,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:18,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:18,879 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:53:18,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t485~0.base_38| 4)) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t485~0.base_38| 1)) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t485~0.base_38|) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= |v_ULTIMATE.start_main_~#t485~0.offset_25| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t485~0.base_38|) 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t485~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t485~0.base_38|) |v_ULTIMATE.start_main_~#t485~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, ULTIMATE.start_main_~#t488~0.offset=|v_ULTIMATE.start_main_~#t488~0.offset_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t487~0.base=|v_ULTIMATE.start_main_~#t487~0.base_30|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t485~0.base=|v_ULTIMATE.start_main_~#t485~0.base_38|, ULTIMATE.start_main_~#t486~0.offset=|v_ULTIMATE.start_main_~#t486~0.offset_26|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t486~0.base=|v_ULTIMATE.start_main_~#t486~0.base_40|, ULTIMATE.start_main_~#t485~0.offset=|v_ULTIMATE.start_main_~#t485~0.offset_25|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ULTIMATE.start_main_~#t487~0.offset=|v_ULTIMATE.start_main_~#t487~0.offset_17|, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t488~0.base=|v_ULTIMATE.start_main_~#t488~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t488~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t487~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t485~0.base, ULTIMATE.start_main_~#t486~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t486~0.base, ULTIMATE.start_main_~#t485~0.offset, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t487~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t488~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:53:18,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t486~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t486~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t486~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t486~0.base_11|) |v_ULTIMATE.start_main_~#t486~0.offset_10| 1)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t486~0.base_11|) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t486~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t486~0.base_11| 4)) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t486~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t486~0.base=|v_ULTIMATE.start_main_~#t486~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t486~0.offset=|v_ULTIMATE.start_main_~#t486~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t486~0.base, ULTIMATE.start_main_~#t486~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 18:53:18,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t487~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t487~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t487~0.base_11|) |v_ULTIMATE.start_main_~#t487~0.offset_11| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t487~0.offset_11|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t487~0.base_11|) 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t487~0.base_11| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t487~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t487~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t487~0.base=|v_ULTIMATE.start_main_~#t487~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t487~0.offset=|v_ULTIMATE.start_main_~#t487~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t487~0.base, #length, ULTIMATE.start_main_~#t487~0.offset] because there is no mapped edge [2019-12-07 18:53:18,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t488~0.base_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t488~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t488~0.base_9|) |v_ULTIMATE.start_main_~#t488~0.offset_8| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t488~0.offset_8|) (not (= |v_ULTIMATE.start_main_~#t488~0.base_9| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t488~0.base_9| 4)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t488~0.base_9| 1) |v_#valid_35|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t488~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t488~0.base=|v_ULTIMATE.start_main_~#t488~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t488~0.offset=|v_ULTIMATE.start_main_~#t488~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t488~0.offset, #length] because there is no mapped edge [2019-12-07 18:53:18,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd3~0_In324030854 ~z$r_buff1_thd3~0_Out324030854) (= ~z$r_buff0_thd0~0_In324030854 ~z$r_buff1_thd0~0_Out324030854) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854)) (= ~z~0_In324030854 ~z$mem_tmp~0_Out324030854) (= ~weak$$choice0~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet26_In324030854|) (= ~z$r_buff1_thd2~0_Out324030854 ~z$r_buff0_thd2~0_In324030854) (= ~weak$$choice2~0_Out324030854 ~z$flush_delayed~0_Out324030854) (= ~z$r_buff0_thd1~0_In324030854 ~z$r_buff1_thd1~0_Out324030854) (= ~z$r_buff0_thd4~0_Out324030854 1) (= ~z$r_buff1_thd4~0_Out324030854 ~z$r_buff0_thd4~0_In324030854) (= ~weak$$choice2~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet27_In324030854|)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In324030854|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In324030854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out324030854|, ~z$mem_tmp~0=~z$mem_tmp~0_Out324030854, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out324030854|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out324030854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out324030854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out324030854, ~z$flush_delayed~0=~z$flush_delayed~0_Out324030854, ~weak$$choice0~0=~weak$$choice0~0_Out324030854, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out324030854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~weak$$choice2~0=~weak$$choice2~0_Out324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:53:18,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-313546918| |P3Thread1of1ForFork2_#t~ite28_Out-313546918|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-313546918 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-313546918 256)))) (or (and .cse0 (= ~z$w_buff0~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-313546918|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-313546918|, ~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:53:18,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:53:18,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In232769166 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z$mem_tmp~0_In232769166) (not .cse0)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z~0_In232769166)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In232769166, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In232769166, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out232769166|, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:53:18,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 18:53:18,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:53:18,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1703162264 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1703162264 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| ~z$w_buff0_used~0_In-1703162264)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1703162264|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:53:18,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In554329280 256) 0))) (or (and (= ~z$mem_tmp~0_In554329280 |P2Thread1of1ForFork1_#t~ite25_Out554329280|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out554329280| ~z~0_In554329280)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In554329280, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In554329280, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out554329280|, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:53:18,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In2135930166 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2135930166 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2135930166 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In2135930166 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| ~z$w_buff1_used~0_In2135930166)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out2135930166|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:53:18,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1858744388 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1858744388 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-1858744388 ~z$r_buff0_thd4~0_In-1858744388))) (or (and (= ~z$r_buff0_thd4~0_Out-1858744388 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1858744388} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1858744388|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:53:18,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2137026623 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2137026623 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2137026623 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2137026623 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-2137026623| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-2137026623 |P3Thread1of1ForFork2_#t~ite54_Out-2137026623|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2137026623|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:53:18,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:53:18,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:53:18,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:53:18,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1612300402 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1612300402 256) 0))) (or (and (= ~z$w_buff1~0_In1612300402 |ULTIMATE.start_main_#t~ite59_Out1612300402|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out1612300402| ~z~0_In1612300402) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ~z~0=~z~0_In1612300402} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1612300402|, ~z~0=~z~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:53:18,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:53:18,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1683418705 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1683418705 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| ~z$w_buff0_used~0_In-1683418705) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1683418705|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:53:18,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2092126768 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2092126768 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2092126768 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2092126768 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2092126768| ~z$w_buff1_used~0_In2092126768) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2092126768|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2092126768|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:53:18,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In667193038 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In667193038 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out667193038| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In667193038 |ULTIMATE.start_main_#t~ite63_Out667193038|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out667193038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:53:18,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1154075606 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1154075606 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1154075606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1154075606 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1154075606 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1154075606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:53:18,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:53:18,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:53:18 BasicIcfg [2019-12-07 18:53:18,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:53:18,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:53:18,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:53:18,961 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:53:18,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:42" (3/4) ... [2019-12-07 18:53:18,963 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:53:18,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t485~0.base_38| 4)) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t485~0.base_38| 1)) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t485~0.base_38|) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= |v_ULTIMATE.start_main_~#t485~0.offset_25| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t485~0.base_38|) 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t485~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t485~0.base_38|) |v_ULTIMATE.start_main_~#t485~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, ULTIMATE.start_main_~#t488~0.offset=|v_ULTIMATE.start_main_~#t488~0.offset_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t487~0.base=|v_ULTIMATE.start_main_~#t487~0.base_30|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t485~0.base=|v_ULTIMATE.start_main_~#t485~0.base_38|, ULTIMATE.start_main_~#t486~0.offset=|v_ULTIMATE.start_main_~#t486~0.offset_26|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t486~0.base=|v_ULTIMATE.start_main_~#t486~0.base_40|, ULTIMATE.start_main_~#t485~0.offset=|v_ULTIMATE.start_main_~#t485~0.offset_25|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ULTIMATE.start_main_~#t487~0.offset=|v_ULTIMATE.start_main_~#t487~0.offset_17|, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t488~0.base=|v_ULTIMATE.start_main_~#t488~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t488~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t487~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t485~0.base, ULTIMATE.start_main_~#t486~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t486~0.base, ULTIMATE.start_main_~#t485~0.offset, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t487~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t488~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:53:18,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t486~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t486~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t486~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t486~0.base_11|) |v_ULTIMATE.start_main_~#t486~0.offset_10| 1)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t486~0.base_11|) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t486~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t486~0.base_11| 4)) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t486~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t486~0.base=|v_ULTIMATE.start_main_~#t486~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t486~0.offset=|v_ULTIMATE.start_main_~#t486~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t486~0.base, ULTIMATE.start_main_~#t486~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 18:53:18,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t487~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t487~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t487~0.base_11|) |v_ULTIMATE.start_main_~#t487~0.offset_11| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t487~0.offset_11|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t487~0.base_11|) 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t487~0.base_11| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t487~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t487~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t487~0.base=|v_ULTIMATE.start_main_~#t487~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t487~0.offset=|v_ULTIMATE.start_main_~#t487~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t487~0.base, #length, ULTIMATE.start_main_~#t487~0.offset] because there is no mapped edge [2019-12-07 18:53:18,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t488~0.base_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t488~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t488~0.base_9|) |v_ULTIMATE.start_main_~#t488~0.offset_8| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t488~0.offset_8|) (not (= |v_ULTIMATE.start_main_~#t488~0.base_9| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t488~0.base_9| 4)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t488~0.base_9| 1) |v_#valid_35|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t488~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t488~0.base=|v_ULTIMATE.start_main_~#t488~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t488~0.offset=|v_ULTIMATE.start_main_~#t488~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t488~0.offset, #length] because there is no mapped edge [2019-12-07 18:53:18,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd3~0_In324030854 ~z$r_buff1_thd3~0_Out324030854) (= ~z$r_buff0_thd0~0_In324030854 ~z$r_buff1_thd0~0_Out324030854) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854)) (= ~z~0_In324030854 ~z$mem_tmp~0_Out324030854) (= ~weak$$choice0~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet26_In324030854|) (= ~z$r_buff1_thd2~0_Out324030854 ~z$r_buff0_thd2~0_In324030854) (= ~weak$$choice2~0_Out324030854 ~z$flush_delayed~0_Out324030854) (= ~z$r_buff0_thd1~0_In324030854 ~z$r_buff1_thd1~0_Out324030854) (= ~z$r_buff0_thd4~0_Out324030854 1) (= ~z$r_buff1_thd4~0_Out324030854 ~z$r_buff0_thd4~0_In324030854) (= ~weak$$choice2~0_Out324030854 |P3Thread1of1ForFork2_#t~nondet27_In324030854|)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In324030854|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In324030854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out324030854|, ~z$mem_tmp~0=~z$mem_tmp~0_Out324030854, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out324030854|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In324030854, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out324030854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out324030854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out324030854, ~z$flush_delayed~0=~z$flush_delayed~0_Out324030854, ~weak$$choice0~0=~weak$$choice0~0_Out324030854, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In324030854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out324030854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out324030854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out324030854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In324030854, ~z~0=~z~0_In324030854, ~weak$$choice2~0=~weak$$choice2~0_Out324030854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324030854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In324030854} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:53:18,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-313546918| |P3Thread1of1ForFork2_#t~ite28_Out-313546918|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-313546918 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-313546918 256)))) (or (and .cse0 (= ~z$w_buff0~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In-313546918 |P3Thread1of1ForFork2_#t~ite28_Out-313546918|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-313546918|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-313546918|, ~z$w_buff0~0=~z$w_buff0~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1~0=~z$w_buff1~0_In-313546918} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:53:18,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:53:18,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In232769166 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z$mem_tmp~0_In232769166) (not .cse0)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out232769166| ~z~0_In232769166)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In232769166, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In232769166, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out232769166|, ~z$flush_delayed~0=~z$flush_delayed~0_In232769166, ~z~0=~z~0_In232769166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:53:18,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 18:53:18,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:53:18,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1703162264 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1703162264 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| ~z$w_buff0_used~0_In-1703162264)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1703162264| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1703162264|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:53:18,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In554329280 256) 0))) (or (and (= ~z$mem_tmp~0_In554329280 |P2Thread1of1ForFork1_#t~ite25_Out554329280|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out554329280| ~z~0_In554329280)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In554329280, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In554329280, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out554329280|, ~z$flush_delayed~0=~z$flush_delayed~0_In554329280, ~z~0=~z~0_In554329280} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:53:18,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In2135930166 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2135930166 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2135930166 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In2135930166 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| ~z$w_buff1_used~0_In2135930166)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite52_Out2135930166| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out2135930166|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2135930166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135930166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1858744388 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1858744388 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-1858744388 ~z$r_buff0_thd4~0_In-1858744388))) (or (and (= ~z$r_buff0_thd4~0_Out-1858744388 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1858744388} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1858744388|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2137026623 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2137026623 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2137026623 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2137026623 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-2137026623| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-2137026623 |P3Thread1of1ForFork2_#t~ite54_Out-2137026623|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2137026623|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2137026623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137026623, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2137026623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137026623} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1612300402 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1612300402 256) 0))) (or (and (= ~z$w_buff1~0_In1612300402 |ULTIMATE.start_main_#t~ite59_Out1612300402|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out1612300402| ~z~0_In1612300402) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ~z~0=~z~0_In1612300402} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1612300402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1612300402, ~z$w_buff1~0=~z$w_buff1~0_In1612300402, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1612300402|, ~z~0=~z~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:53:18,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1683418705 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1683418705 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1683418705| ~z$w_buff0_used~0_In-1683418705) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683418705, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1683418705|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683418705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:53:18,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2092126768 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2092126768 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2092126768 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2092126768 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2092126768| ~z$w_buff1_used~0_In2092126768) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2092126768|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2092126768|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2092126768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2092126768, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2092126768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2092126768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:53:18,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In667193038 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In667193038 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out667193038| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In667193038 |ULTIMATE.start_main_#t~ite63_Out667193038|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out667193038|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In667193038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In667193038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:53:18,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1154075606 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1154075606 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1154075606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1154075606 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1154075606 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out-1154075606|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1154075606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1154075606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1154075606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1154075606, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1154075606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:53:18,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:53:19,040 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_941b8ba9-ad8a-4828-ae84-03810837639d/bin/uautomizer/witness.graphml [2019-12-07 18:53:19,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:53:19,041 INFO L168 Benchmark]: Toolchain (without parser) took 157400.00 ms. Allocated memory was 1.0 GB in the beginning and 9.1 GB in the end (delta: 8.1 GB). Free memory was 938.2 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:53:19,041 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:19,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:19,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:19,042 INFO L168 Benchmark]: Boogie Preprocessor took 29.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:19,042 INFO L168 Benchmark]: RCFGBuilder took 469.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:19,043 INFO L168 Benchmark]: TraceAbstraction took 156364.23 ms. Allocated memory was 1.1 GB in the beginning and 9.1 GB in the end (delta: 8.0 GB). Free memory was 999.7 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:53:19,043 INFO L168 Benchmark]: Witness Printer took 79.28 ms. Allocated memory is still 9.1 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:19,044 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 469.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 156364.23 ms. Allocated memory was 1.1 GB in the beginning and 9.1 GB in the end (delta: 8.0 GB). Free memory was 999.7 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. * Witness Printer took 79.28 ms. Allocated memory is still 9.1 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 340 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 380 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4886 SDtfs, 7264 SDslu, 9645 SDs, 0 SdLazy, 3313 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322646occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 102.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 478016 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 883 NumberOfCodeBlocks, 883 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 795 ConstructedInterpolants, 0 QuantifiedInterpolants, 253710 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...