/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:11:43,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:11:43,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:11:43,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:11:43,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:11:43,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:11:43,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:11:43,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:11:43,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:11:43,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:11:43,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:11:43,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:11:43,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:11:43,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:11:43,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:11:43,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:11:43,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:11:43,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:11:43,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:11:43,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:11:43,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:11:43,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:11:43,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:11:43,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:11:43,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:11:43,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:11:43,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:11:43,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:11:43,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:11:43,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:11:43,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:11:43,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:11:43,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:11:43,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:11:43,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:11:43,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:11:43,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:11:43,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:11:43,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:11:43,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:11:43,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:11:43,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:11:43,329 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:11:43,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:11:43,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:11:43,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:11:43,331 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:11:43,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:11:43,331 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:11:43,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:11:43,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:11:43,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:11:43,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:11:43,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:11:43,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:11:43,332 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:11:43,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:11:43,333 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:11:43,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:11:43,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:11:43,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:11:43,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:11:43,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:11:43,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:43,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:11:43,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:11:43,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:11:43,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:11:43,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:11:43,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:11:43,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:11:43,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:11:43,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:11:43,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:11:43,675 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:11:43,675 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:11:43,676 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-10-16 12:11:43,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f14c051e/e5b85a5e34ac406e9e9d888dca09a71d/FLAG710c5b799 [2020-10-16 12:11:44,378 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:11:44,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-10-16 12:11:44,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f14c051e/e5b85a5e34ac406e9e9d888dca09a71d/FLAG710c5b799 [2020-10-16 12:11:44,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f14c051e/e5b85a5e34ac406e9e9d888dca09a71d [2020-10-16 12:11:44,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:11:44,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:11:44,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:44,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:11:44,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:11:44,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:44" (1/1) ... [2020-10-16 12:11:44,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7a4bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:44, skipping insertion in model container [2020-10-16 12:11:44,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:44" (1/1) ... [2020-10-16 12:11:44,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:11:44,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:11:45,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:45,287 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:11:45,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:45,463 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:11:45,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45 WrapperNode [2020-10-16 12:11:45,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:45,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:45,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:11:45,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:11:45,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:45,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:11:45,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:11:45,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:11:45,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... [2020-10-16 12:11:45,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:11:45,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:11:45,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:11:45,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:11:45,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:11:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:11:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:11:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:11:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:11:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:11:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:11:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:11:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:11:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:11:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:11:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:11:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:11:45,696 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:11:49,130 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:11:49,130 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:11:49,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:49 BoogieIcfgContainer [2020-10-16 12:11:49,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:11:49,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:11:49,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:11:49,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:11:49,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:11:44" (1/3) ... [2020-10-16 12:11:49,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221e1e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:49, skipping insertion in model container [2020-10-16 12:11:49,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:45" (2/3) ... [2020-10-16 12:11:49,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221e1e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:49, skipping insertion in model container [2020-10-16 12:11:49,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:49" (3/3) ... [2020-10-16 12:11:49,143 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2020-10-16 12:11:49,156 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:11:49,157 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:11:49,165 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:11:49,166 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:11:49,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,227 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,234 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,249 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,252 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,253 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,254 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:49,256 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:11:49,271 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:11:49,292 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:11:49,292 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:11:49,292 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:11:49,293 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:11:49,293 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:11:49,293 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:11:49,293 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:11:49,293 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:11:49,306 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:11:49,307 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:49,310 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:49,312 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:49,415 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 12:11:49,415 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:11:49,423 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:11:49,430 INFO L117 LiptonReduction]: Number of co-enabled transitions 1624 [2020-10-16 12:11:49,826 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:11:50,804 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:11:50,916 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:11:51,237 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-10-16 12:11:52,683 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 12:11:52,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 12:11:52,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:52,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:11:52,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:53,989 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-10-16 12:11:55,016 WARN L193 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-16 12:11:55,303 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 12:11:56,520 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 12:11:56,840 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:11:57,094 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:11:57,210 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:11:57,223 INFO L132 LiptonReduction]: Checked pairs total: 4248 [2020-10-16 12:11:57,223 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 12:11:57,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:11:57,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-16 12:11:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-16 12:11:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:11:57,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,354 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-16 12:11:57,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451972992] [2020-10-16 12:11:57,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:57,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451972992] [2020-10-16 12:11:57,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:57,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:57,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151821219] [2020-10-16 12:11:57,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:57,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:57,689 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-16 12:11:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:57,855 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-10-16 12:11:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:57,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:11:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:57,887 INFO L225 Difference]: With dead ends: 658 [2020-10-16 12:11:57,887 INFO L226 Difference]: Without dead ends: 538 [2020-10-16 12:11:57,889 INFO L677 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 [2020-10-16 12:11:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-16 12:11:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-10-16 12:11:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-16 12:11:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-10-16 12:11:58,005 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-10-16 12:11:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,006 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-10-16 12:11:58,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-10-16 12:11:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:58,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:11:58,009 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-16 12:11:58,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780237019] [2020-10-16 12:11:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780237019] [2020-10-16 12:11:58,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:58,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301230676] [2020-10-16 12:11:58,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:58,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:58,119 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 3 states. [2020-10-16 12:11:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:58,136 INFO L93 Difference]: Finished difference Result 478 states and 1431 transitions. [2020-10-16 12:11:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:58,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:11:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:58,143 INFO L225 Difference]: With dead ends: 478 [2020-10-16 12:11:58,143 INFO L226 Difference]: Without dead ends: 478 [2020-10-16 12:11:58,144 INFO L677 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 [2020-10-16 12:11:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-16 12:11:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2020-10-16 12:11:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-10-16 12:11:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1431 transitions. [2020-10-16 12:11:58,219 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1431 transitions. Word has length 9 [2020-10-16 12:11:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,219 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 1431 transitions. [2020-10-16 12:11:58,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1431 transitions. [2020-10-16 12:11:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:58,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:11:58,223 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1678623485, now seen corresponding path program 1 times [2020-10-16 12:11:58,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129582338] [2020-10-16 12:11:58,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129582338] [2020-10-16 12:11:58,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:58,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796792995] [2020-10-16 12:11:58,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:58,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:58,367 INFO L87 Difference]: Start difference. First operand 478 states and 1431 transitions. Second operand 3 states. [2020-10-16 12:11:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:58,384 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-10-16 12:11:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:58,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:11:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:58,389 INFO L225 Difference]: With dead ends: 472 [2020-10-16 12:11:58,389 INFO L226 Difference]: Without dead ends: 472 [2020-10-16 12:11:58,390 INFO L677 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 [2020-10-16 12:11:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-16 12:11:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-10-16 12:11:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-16 12:11:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-10-16 12:11:58,408 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 12 [2020-10-16 12:11:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,408 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-10-16 12:11:58,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-10-16 12:11:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:58,419 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:11:58,420 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash 733241045, now seen corresponding path program 1 times [2020-10-16 12:11:58,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818759047] [2020-10-16 12:11:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818759047] [2020-10-16 12:11:58,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:58,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488136019] [2020-10-16 12:11:58,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:58,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:58,643 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 6 states. [2020-10-16 12:11:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:58,936 INFO L93 Difference]: Finished difference Result 705 states and 2098 transitions. [2020-10-16 12:11:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:11:58,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:11:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:58,944 INFO L225 Difference]: With dead ends: 705 [2020-10-16 12:11:58,944 INFO L226 Difference]: Without dead ends: 705 [2020-10-16 12:11:58,945 INFO L677 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 [2020-10-16 12:11:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2020-10-16 12:11:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 615. [2020-10-16 12:11:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2020-10-16 12:11:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1837 transitions. [2020-10-16 12:11:58,970 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1837 transitions. Word has length 13 [2020-10-16 12:11:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,971 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 1837 transitions. [2020-10-16 12:11:58,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1837 transitions. [2020-10-16 12:11:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:58,973 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:11:58,974 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash -929552857, now seen corresponding path program 1 times [2020-10-16 12:11:58,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194885022] [2020-10-16 12:11:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:59,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194885022] [2020-10-16 12:11:59,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:59,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:11:59,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648125120] [2020-10-16 12:11:59,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:11:59,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:11:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:59,289 INFO L87 Difference]: Start difference. First operand 615 states and 1837 transitions. Second operand 7 states. [2020-10-16 12:11:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:59,517 INFO L93 Difference]: Finished difference Result 795 states and 2323 transitions. [2020-10-16 12:11:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:59,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-16 12:11:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:59,523 INFO L225 Difference]: With dead ends: 795 [2020-10-16 12:11:59,523 INFO L226 Difference]: Without dead ends: 559 [2020-10-16 12:11:59,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-16 12:11:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-16 12:11:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-16 12:11:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1658 transitions. [2020-10-16 12:11:59,543 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1658 transitions. Word has length 14 [2020-10-16 12:11:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:59,544 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 1658 transitions. [2020-10-16 12:11:59,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:11:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1658 transitions. [2020-10-16 12:11:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:59,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:59,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:59,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:11:59,546 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:59,547 INFO L82 PathProgramCache]: Analyzing trace with hash -70668655, now seen corresponding path program 1 times [2020-10-16 12:11:59,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:59,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385446041] [2020-10-16 12:11:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:59,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385446041] [2020-10-16 12:11:59,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:59,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:59,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113831239] [2020-10-16 12:11:59,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:59,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:59,682 INFO L87 Difference]: Start difference. First operand 559 states and 1658 transitions. Second operand 5 states. [2020-10-16 12:11:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:59,858 INFO L93 Difference]: Finished difference Result 616 states and 1836 transitions. [2020-10-16 12:11:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:59,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:11:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:59,863 INFO L225 Difference]: With dead ends: 616 [2020-10-16 12:11:59,864 INFO L226 Difference]: Without dead ends: 616 [2020-10-16 12:11:59,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-10-16 12:11:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 544. [2020-10-16 12:11:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-10-16 12:11:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1590 transitions. [2020-10-16 12:11:59,886 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1590 transitions. Word has length 14 [2020-10-16 12:11:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:59,887 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 1590 transitions. [2020-10-16 12:11:59,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1590 transitions. [2020-10-16 12:11:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:59,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:59,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:59,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:11:59,890 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 250991359, now seen corresponding path program 1 times [2020-10-16 12:11:59,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:59,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163202872] [2020-10-16 12:11:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:00,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163202872] [2020-10-16 12:12:00,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:00,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:00,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965225987] [2020-10-16 12:12:00,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:00,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:00,260 INFO L87 Difference]: Start difference. First operand 544 states and 1590 transitions. Second operand 7 states. [2020-10-16 12:12:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:00,667 INFO L93 Difference]: Finished difference Result 792 states and 2300 transitions. [2020-10-16 12:12:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:12:00,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 12:12:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:00,674 INFO L225 Difference]: With dead ends: 792 [2020-10-16 12:12:00,674 INFO L226 Difference]: Without dead ends: 720 [2020-10-16 12:12:00,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-10-16 12:12:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 558. [2020-10-16 12:12:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-16 12:12:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1633 transitions. [2020-10-16 12:12:00,701 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1633 transitions. Word has length 15 [2020-10-16 12:12:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:00,701 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1633 transitions. [2020-10-16 12:12:00,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1633 transitions. [2020-10-16 12:12:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:00,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:00,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:00,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:12:00,704 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash 251229687, now seen corresponding path program 1 times [2020-10-16 12:12:00,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:00,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405932491] [2020-10-16 12:12:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:01,059 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2020-10-16 12:12:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:01,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405932491] [2020-10-16 12:12:01,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:01,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:01,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330500963] [2020-10-16 12:12:01,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:01,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:01,234 INFO L87 Difference]: Start difference. First operand 558 states and 1633 transitions. Second operand 7 states. [2020-10-16 12:12:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:01,770 INFO L93 Difference]: Finished difference Result 760 states and 2248 transitions. [2020-10-16 12:12:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:01,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 12:12:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:01,776 INFO L225 Difference]: With dead ends: 760 [2020-10-16 12:12:01,776 INFO L226 Difference]: Without dead ends: 760 [2020-10-16 12:12:01,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2020-10-16 12:12:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 636. [2020-10-16 12:12:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-10-16 12:12:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1894 transitions. [2020-10-16 12:12:01,800 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1894 transitions. Word has length 15 [2020-10-16 12:12:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:01,800 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 1894 transitions. [2020-10-16 12:12:01,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1894 transitions. [2020-10-16 12:12:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:01,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:01,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:01,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:12:01,803 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 252796489, now seen corresponding path program 2 times [2020-10-16 12:12:01,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:01,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488127565] [2020-10-16 12:12:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:01,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488127565] [2020-10-16 12:12:01,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:01,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:12:01,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109135342] [2020-10-16 12:12:01,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:12:01,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:12:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:12:01,984 INFO L87 Difference]: Start difference. First operand 636 states and 1894 transitions. Second operand 9 states. [2020-10-16 12:12:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:02,471 INFO L93 Difference]: Finished difference Result 1212 states and 3522 transitions. [2020-10-16 12:12:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 12:12:02,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-16 12:12:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:02,486 INFO L225 Difference]: With dead ends: 1212 [2020-10-16 12:12:02,487 INFO L226 Difference]: Without dead ends: 1188 [2020-10-16 12:12:02,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:12:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-10-16 12:12:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 748. [2020-10-16 12:12:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2020-10-16 12:12:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2248 transitions. [2020-10-16 12:12:02,515 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2248 transitions. Word has length 15 [2020-10-16 12:12:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:02,515 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 2248 transitions. [2020-10-16 12:12:02,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:12:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2248 transitions. [2020-10-16 12:12:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:02,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:02,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:02,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:12:02,518 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2102432609, now seen corresponding path program 3 times [2020-10-16 12:12:02,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:02,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643816546] [2020-10-16 12:12:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:02,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643816546] [2020-10-16 12:12:02,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:02,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:02,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366880910] [2020-10-16 12:12:02,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:02,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:02,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:02,656 INFO L87 Difference]: Start difference. First operand 748 states and 2248 transitions. Second operand 6 states. [2020-10-16 12:12:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:02,887 INFO L93 Difference]: Finished difference Result 844 states and 2524 transitions. [2020-10-16 12:12:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:12:02,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:12:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:02,897 INFO L225 Difference]: With dead ends: 844 [2020-10-16 12:12:02,897 INFO L226 Difference]: Without dead ends: 844 [2020-10-16 12:12:02,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-10-16 12:12:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 708. [2020-10-16 12:12:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-10-16 12:12:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 2108 transitions. [2020-10-16 12:12:02,919 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 2108 transitions. Word has length 15 [2020-10-16 12:12:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:02,920 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 2108 transitions. [2020-10-16 12:12:02,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 2108 transitions. [2020-10-16 12:12:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:02,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:02,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:02,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:12:02,923 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash 356368495, now seen corresponding path program 2 times [2020-10-16 12:12:02,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:02,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669771543] [2020-10-16 12:12:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:03,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669771543] [2020-10-16 12:12:03,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:03,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:03,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974570981] [2020-10-16 12:12:03,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:03,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:03,155 INFO L87 Difference]: Start difference. First operand 708 states and 2108 transitions. Second operand 6 states. [2020-10-16 12:12:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:03,427 INFO L93 Difference]: Finished difference Result 918 states and 2693 transitions. [2020-10-16 12:12:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:03,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:12:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:03,435 INFO L225 Difference]: With dead ends: 918 [2020-10-16 12:12:03,435 INFO L226 Difference]: Without dead ends: 822 [2020-10-16 12:12:03,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-10-16 12:12:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 602. [2020-10-16 12:12:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-16 12:12:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1725 transitions. [2020-10-16 12:12:03,454 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1725 transitions. Word has length 15 [2020-10-16 12:12:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,454 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1725 transitions. [2020-10-16 12:12:03,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1725 transitions. [2020-10-16 12:12:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:12:03,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:12:03,457 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2101548220, now seen corresponding path program 1 times [2020-10-16 12:12:03,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364286638] [2020-10-16 12:12:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:03,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364286638] [2020-10-16 12:12:03,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:03,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:12:03,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120601004] [2020-10-16 12:12:03,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:12:03,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:12:03,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:12:03,506 INFO L87 Difference]: Start difference. First operand 602 states and 1725 transitions. Second operand 3 states. [2020-10-16 12:12:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:03,518 INFO L93 Difference]: Finished difference Result 816 states and 2269 transitions. [2020-10-16 12:12:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:12:03,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-16 12:12:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:03,522 INFO L225 Difference]: With dead ends: 816 [2020-10-16 12:12:03,523 INFO L226 Difference]: Without dead ends: 520 [2020-10-16 12:12:03,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:12:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-10-16 12:12:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 508. [2020-10-16 12:12:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2020-10-16 12:12:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1349 transitions. [2020-10-16 12:12:03,536 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1349 transitions. Word has length 15 [2020-10-16 12:12:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,537 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 1349 transitions. [2020-10-16 12:12:03,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:12:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1349 transitions. [2020-10-16 12:12:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:03,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:12:03,539 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,539 INFO L82 PathProgramCache]: Analyzing trace with hash -304586127, now seen corresponding path program 1 times [2020-10-16 12:12:03,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177945898] [2020-10-16 12:12:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:04,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177945898] [2020-10-16 12:12:04,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:04,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:12:04,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65970055] [2020-10-16 12:12:04,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:12:04,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:12:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:04,109 INFO L87 Difference]: Start difference. First operand 508 states and 1349 transitions. Second operand 10 states. [2020-10-16 12:12:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,541 INFO L93 Difference]: Finished difference Result 514 states and 1356 transitions. [2020-10-16 12:12:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:04,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-16 12:12:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,545 INFO L225 Difference]: With dead ends: 514 [2020-10-16 12:12:04,545 INFO L226 Difference]: Without dead ends: 470 [2020-10-16 12:12:04,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-16 12:12:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-10-16 12:12:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-10-16 12:12:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1268 transitions. [2020-10-16 12:12:04,558 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1268 transitions. Word has length 16 [2020-10-16 12:12:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,558 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1268 transitions. [2020-10-16 12:12:04,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:12:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1268 transitions. [2020-10-16 12:12:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:04,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:12:04,561 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -753244437, now seen corresponding path program 2 times [2020-10-16 12:12:04,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522682374] [2020-10-16 12:12:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,910 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 21 [2020-10-16 12:12:05,033 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-10-16 12:12:05,174 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2020-10-16 12:12:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:05,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522682374] [2020-10-16 12:12:05,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:05,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:12:05,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283739144] [2020-10-16 12:12:05,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:12:05,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:12:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:05,319 INFO L87 Difference]: Start difference. First operand 470 states and 1268 transitions. Second operand 10 states. [2020-10-16 12:12:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:05,728 INFO L93 Difference]: Finished difference Result 494 states and 1320 transitions. [2020-10-16 12:12:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:05,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-16 12:12:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:05,732 INFO L225 Difference]: With dead ends: 494 [2020-10-16 12:12:05,732 INFO L226 Difference]: Without dead ends: 480 [2020-10-16 12:12:05,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:12:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-10-16 12:12:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 462. [2020-10-16 12:12:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-10-16 12:12:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1246 transitions. [2020-10-16 12:12:05,746 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1246 transitions. Word has length 16 [2020-10-16 12:12:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:05,747 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 1246 transitions. [2020-10-16 12:12:05,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:12:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1246 transitions. [2020-10-16 12:12:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:05,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:05,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:05,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:12:05,749 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1265012645, now seen corresponding path program 3 times [2020-10-16 12:12:05,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:05,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589103961] [2020-10-16 12:12:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:06,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589103961] [2020-10-16 12:12:06,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:06,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:12:06,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293553015] [2020-10-16 12:12:06,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:12:06,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:12:06,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:12:06,241 INFO L87 Difference]: Start difference. First operand 462 states and 1246 transitions. Second operand 9 states. [2020-10-16 12:12:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:06,562 INFO L93 Difference]: Finished difference Result 480 states and 1285 transitions. [2020-10-16 12:12:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:06,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 12:12:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:06,567 INFO L225 Difference]: With dead ends: 480 [2020-10-16 12:12:06,567 INFO L226 Difference]: Without dead ends: 427 [2020-10-16 12:12:06,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-16 12:12:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 365. [2020-10-16 12:12:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-10-16 12:12:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 983 transitions. [2020-10-16 12:12:06,578 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 983 transitions. Word has length 16 [2020-10-16 12:12:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:06,578 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 983 transitions. [2020-10-16 12:12:06,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:12:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 983 transitions. [2020-10-16 12:12:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:06,579 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:06,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:06,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:12:06,580 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -723485020, now seen corresponding path program 1 times [2020-10-16 12:12:06,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:06,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591308178] [2020-10-16 12:12:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:06,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591308178] [2020-10-16 12:12:06,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:06,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:12:06,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783132915] [2020-10-16 12:12:06,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:12:06,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:12:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:12:06,664 INFO L87 Difference]: Start difference. First operand 365 states and 983 transitions. Second operand 4 states. [2020-10-16 12:12:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:06,700 INFO L93 Difference]: Finished difference Result 362 states and 855 transitions. [2020-10-16 12:12:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:12:06,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:12:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:06,703 INFO L225 Difference]: With dead ends: 362 [2020-10-16 12:12:06,703 INFO L226 Difference]: Without dead ends: 253 [2020-10-16 12:12:06,704 INFO L677 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 [2020-10-16 12:12:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-10-16 12:12:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2020-10-16 12:12:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-16 12:12:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 579 transitions. [2020-10-16 12:12:06,711 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 579 transitions. Word has length 16 [2020-10-16 12:12:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:06,711 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 579 transitions. [2020-10-16 12:12:06,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:12:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 579 transitions. [2020-10-16 12:12:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:12:06,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:06,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:06,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:12:06,713 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash 233701298, now seen corresponding path program 1 times [2020-10-16 12:12:06,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:06,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249145693] [2020-10-16 12:12:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:06,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249145693] [2020-10-16 12:12:06,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:06,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:06,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847648459] [2020-10-16 12:12:06,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:12:06,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:12:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:06,802 INFO L87 Difference]: Start difference. First operand 253 states and 579 transitions. Second operand 5 states. [2020-10-16 12:12:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:06,852 INFO L93 Difference]: Finished difference Result 214 states and 442 transitions. [2020-10-16 12:12:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:06,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:12:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:06,854 INFO L225 Difference]: With dead ends: 214 [2020-10-16 12:12:06,854 INFO L226 Difference]: Without dead ends: 157 [2020-10-16 12:12:06,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-16 12:12:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-10-16 12:12:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-16 12:12:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 310 transitions. [2020-10-16 12:12:06,859 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 310 transitions. Word has length 17 [2020-10-16 12:12:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:06,859 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 310 transitions. [2020-10-16 12:12:06,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:12:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 310 transitions. [2020-10-16 12:12:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:12:06,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:06,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:06,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:12:06,861 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash -499071186, now seen corresponding path program 1 times [2020-10-16 12:12:06,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:06,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626119743] [2020-10-16 12:12:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:06,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626119743] [2020-10-16 12:12:06,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:06,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:06,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816796518] [2020-10-16 12:12:06,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:06,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:06,970 INFO L87 Difference]: Start difference. First operand 157 states and 310 transitions. Second operand 6 states. [2020-10-16 12:12:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:07,027 INFO L93 Difference]: Finished difference Result 141 states and 276 transitions. [2020-10-16 12:12:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:07,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:12:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:07,029 INFO L225 Difference]: With dead ends: 141 [2020-10-16 12:12:07,029 INFO L226 Difference]: Without dead ends: 120 [2020-10-16 12:12:07,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-16 12:12:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2020-10-16 12:12:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-16 12:12:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 193 transitions. [2020-10-16 12:12:07,033 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 193 transitions. Word has length 19 [2020-10-16 12:12:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:07,033 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 193 transitions. [2020-10-16 12:12:07,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 193 transitions. [2020-10-16 12:12:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:07,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:07,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:07,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:12:07,035 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash -697931189, now seen corresponding path program 1 times [2020-10-16 12:12:07,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:07,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490049888] [2020-10-16 12:12:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:07,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490049888] [2020-10-16 12:12:07,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:07,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 12:12:07,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739093447] [2020-10-16 12:12:07,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 12:12:07,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 12:12:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:07,527 INFO L87 Difference]: Start difference. First operand 100 states and 193 transitions. Second operand 12 states. [2020-10-16 12:12:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:07,995 INFO L93 Difference]: Finished difference Result 117 states and 218 transitions. [2020-10-16 12:12:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:07,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-16 12:12:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:07,997 INFO L225 Difference]: With dead ends: 117 [2020-10-16 12:12:07,997 INFO L226 Difference]: Without dead ends: 103 [2020-10-16 12:12:07,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-10-16 12:12:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-16 12:12:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2020-10-16 12:12:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-16 12:12:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 187 transitions. [2020-10-16 12:12:08,001 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 187 transitions. Word has length 21 [2020-10-16 12:12:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:08,001 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 187 transitions. [2020-10-16 12:12:08,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 12:12:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 187 transitions. [2020-10-16 12:12:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:08,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:08,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:08,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:12:08,003 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1113770657, now seen corresponding path program 2 times [2020-10-16 12:12:08,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:08,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45331830] [2020-10-16 12:12:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:08,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45331830] [2020-10-16 12:12:08,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:08,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 12:12:08,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852655026] [2020-10-16 12:12:08,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 12:12:08,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:08,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 12:12:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:08,544 INFO L87 Difference]: Start difference. First operand 97 states and 187 transitions. Second operand 12 states. [2020-10-16 12:12:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:09,005 INFO L93 Difference]: Finished difference Result 123 states and 224 transitions. [2020-10-16 12:12:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 12:12:09,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-16 12:12:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:09,007 INFO L225 Difference]: With dead ends: 123 [2020-10-16 12:12:09,007 INFO L226 Difference]: Without dead ends: 92 [2020-10-16 12:12:09,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-10-16 12:12:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-16 12:12:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2020-10-16 12:12:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-16 12:12:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 172 transitions. [2020-10-16 12:12:09,010 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 172 transitions. Word has length 21 [2020-10-16 12:12:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:09,010 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 172 transitions. [2020-10-16 12:12:09,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 12:12:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 172 transitions. [2020-10-16 12:12:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:09,011 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:09,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:09,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:12:09,011 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1746927867, now seen corresponding path program 3 times [2020-10-16 12:12:09,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:09,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100800904] [2020-10-16 12:12:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:09,868 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-10-16 12:12:09,997 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-10-16 12:12:10,135 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-10-16 12:12:10,297 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-10-16 12:12:10,450 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-10-16 12:12:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:10,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100800904] [2020-10-16 12:12:10,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:10,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-16 12:12:10,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691267144] [2020-10-16 12:12:10,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-16 12:12:10,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-16 12:12:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:12:10,538 INFO L87 Difference]: Start difference. First operand 88 states and 172 transitions. Second operand 15 states. [2020-10-16 12:12:10,700 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-10-16 12:12:10,834 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-10-16 12:12:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:11,761 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2020-10-16 12:12:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:11,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-10-16 12:12:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:11,764 INFO L225 Difference]: With dead ends: 134 [2020-10-16 12:12:11,764 INFO L226 Difference]: Without dead ends: 116 [2020-10-16 12:12:11,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-10-16 12:12:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-16 12:12:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2020-10-16 12:12:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-16 12:12:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 196 transitions. [2020-10-16 12:12:11,768 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 196 transitions. Word has length 21 [2020-10-16 12:12:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:11,768 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 196 transitions. [2020-10-16 12:12:11,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-16 12:12:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 196 transitions. [2020-10-16 12:12:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:11,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:11,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:11,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:12:11,769 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash -607751599, now seen corresponding path program 4 times [2020-10-16 12:12:11,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:11,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713267054] [2020-10-16 12:12:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:12,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713267054] [2020-10-16 12:12:12,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:12,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 12:12:12,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104818111] [2020-10-16 12:12:12,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 12:12:12,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 12:12:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:12:12,766 INFO L87 Difference]: Start difference. First operand 100 states and 196 transitions. Second operand 14 states. [2020-10-16 12:12:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:13,738 INFO L93 Difference]: Finished difference Result 121 states and 233 transitions. [2020-10-16 12:12:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:13,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-10-16 12:12:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:13,740 INFO L225 Difference]: With dead ends: 121 [2020-10-16 12:12:13,740 INFO L226 Difference]: Without dead ends: 113 [2020-10-16 12:12:13,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-10-16 12:12:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-16 12:12:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2020-10-16 12:12:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-16 12:12:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 194 transitions. [2020-10-16 12:12:13,743 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 194 transitions. Word has length 21 [2020-10-16 12:12:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:13,744 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 194 transitions. [2020-10-16 12:12:13,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 12:12:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 194 transitions. [2020-10-16 12:12:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:13,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:13,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:13,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:12:13,745 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1616105747, now seen corresponding path program 5 times [2020-10-16 12:12:13,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:13,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229246993] [2020-10-16 12:12:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:14,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229246993] [2020-10-16 12:12:14,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:14,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:12:14,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900683452] [2020-10-16 12:12:14,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:12:14,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:12:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:12:14,090 INFO L87 Difference]: Start difference. First operand 100 states and 194 transitions. Second operand 9 states. [2020-10-16 12:12:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:14,684 INFO L93 Difference]: Finished difference Result 171 states and 331 transitions. [2020-10-16 12:12:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:14,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 12:12:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:14,686 INFO L225 Difference]: With dead ends: 171 [2020-10-16 12:12:14,686 INFO L226 Difference]: Without dead ends: 100 [2020-10-16 12:12:14,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:12:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-16 12:12:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2020-10-16 12:12:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-16 12:12:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 142 transitions. [2020-10-16 12:12:14,689 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 142 transitions. Word has length 21 [2020-10-16 12:12:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:14,691 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 142 transitions. [2020-10-16 12:12:14,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:12:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 142 transitions. [2020-10-16 12:12:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:14,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:14,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:14,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 12:12:14,693 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1517915563, now seen corresponding path program 6 times [2020-10-16 12:12:14,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:14,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240123105] [2020-10-16 12:12:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:14,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240123105] [2020-10-16 12:12:14,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:14,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:14,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96889951] [2020-10-16 12:12:14,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:14,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:14,941 INFO L87 Difference]: Start difference. First operand 77 states and 142 transitions. Second operand 7 states. [2020-10-16 12:12:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:15,550 INFO L93 Difference]: Finished difference Result 126 states and 229 transitions. [2020-10-16 12:12:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:12:15,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:12:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:15,552 INFO L225 Difference]: With dead ends: 126 [2020-10-16 12:12:15,552 INFO L226 Difference]: Without dead ends: 108 [2020-10-16 12:12:15,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-16 12:12:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2020-10-16 12:12:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-16 12:12:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 144 transitions. [2020-10-16 12:12:15,555 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 144 transitions. Word has length 21 [2020-10-16 12:12:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:15,555 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 144 transitions. [2020-10-16 12:12:15,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 144 transitions. [2020-10-16 12:12:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:15,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:15,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:15,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 12:12:15,557 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1387093443, now seen corresponding path program 7 times [2020-10-16 12:12:15,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:15,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919115603] [2020-10-16 12:12:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:15,943 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-10-16 12:12:16,076 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-10-16 12:12:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:16,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919115603] [2020-10-16 12:12:16,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:16,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:12:16,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662433523] [2020-10-16 12:12:16,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:12:16,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:12:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:16,115 INFO L87 Difference]: Start difference. First operand 81 states and 144 transitions. Second operand 8 states. [2020-10-16 12:12:16,261 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-10-16 12:12:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:16,812 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-10-16 12:12:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 12:12:16,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-16 12:12:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:16,814 INFO L225 Difference]: With dead ends: 117 [2020-10-16 12:12:16,814 INFO L226 Difference]: Without dead ends: 84 [2020-10-16 12:12:16,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:12:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-16 12:12:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2020-10-16 12:12:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-16 12:12:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 118 transitions. [2020-10-16 12:12:16,817 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 118 transitions. Word has length 21 [2020-10-16 12:12:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:16,817 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 118 transitions. [2020-10-16 12:12:16,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:12:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 118 transitions. [2020-10-16 12:12:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:16,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:16,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:16,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 12:12:16,819 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:16,819 INFO L82 PathProgramCache]: Analyzing trace with hash -503555769, now seen corresponding path program 8 times [2020-10-16 12:12:16,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:16,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047431406] [2020-10-16 12:12:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:17,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047431406] [2020-10-16 12:12:17,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:17,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:12:17,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375142384] [2020-10-16 12:12:17,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:12:17,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:12:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:17,105 INFO L87 Difference]: Start difference. First operand 68 states and 118 transitions. Second operand 10 states. [2020-10-16 12:12:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:17,543 INFO L93 Difference]: Finished difference Result 82 states and 140 transitions. [2020-10-16 12:12:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 12:12:17,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-16 12:12:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:17,545 INFO L225 Difference]: With dead ends: 82 [2020-10-16 12:12:17,546 INFO L226 Difference]: Without dead ends: 52 [2020-10-16 12:12:17,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-16 12:12:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-10-16 12:12:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-16 12:12:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2020-10-16 12:12:17,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 21 [2020-10-16 12:12:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:17,548 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2020-10-16 12:12:17,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:12:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2020-10-16 12:12:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:17,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:17,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:17,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 12:12:17,549 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -284254259, now seen corresponding path program 9 times [2020-10-16 12:12:17,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:17,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414308418] [2020-10-16 12:12:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:17,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414308418] [2020-10-16 12:12:17,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:17,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:12:17,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770579790] [2020-10-16 12:12:17,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:12:17,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:12:17,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:17,924 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 11 states. [2020-10-16 12:12:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:18,325 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2020-10-16 12:12:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:18,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-16 12:12:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:18,326 INFO L225 Difference]: With dead ends: 83 [2020-10-16 12:12:18,326 INFO L226 Difference]: Without dead ends: 47 [2020-10-16 12:12:18,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-16 12:12:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2020-10-16 12:12:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-16 12:12:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-10-16 12:12:18,329 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 21 [2020-10-16 12:12:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:18,329 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-10-16 12:12:18,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:12:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-10-16 12:12:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:18,329 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:18,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:18,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 12:12:18,330 INFO L429 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash -361328219, now seen corresponding path program 10 times [2020-10-16 12:12:18,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:18,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135828013] [2020-10-16 12:12:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:18,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135828013] [2020-10-16 12:12:18,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:18,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:18,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286186635] [2020-10-16 12:12:18,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:18,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:18,627 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 7 states. [2020-10-16 12:12:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:18,769 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2020-10-16 12:12:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:18,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:12:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:18,771 INFO L225 Difference]: With dead ends: 67 [2020-10-16 12:12:18,772 INFO L226 Difference]: Without dead ends: 37 [2020-10-16 12:12:18,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-16 12:12:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-16 12:12:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-16 12:12:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-16 12:12:18,774 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-10-16 12:12:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:18,774 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-16 12:12:18,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-10-16 12:12:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:18,774 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:18,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:18,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 12:12:18,775 INFO L429 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:18,775 INFO L82 PathProgramCache]: Analyzing trace with hash 559176997, now seen corresponding path program 11 times [2020-10-16 12:12:18,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:18,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958242968] [2020-10-16 12:12:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:12:18,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:12:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:12:18,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:12:19,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:12:19,031 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:12:19,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 12:12:19,032 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:12:19,054 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse8 (= (mod ~x$w_buff1_used~0_In593080351 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In593080351 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In593080351 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In593080351 256) 0))) (let ((.cse0 (or .cse7 .cse6)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~x$r_buff0_thd0~0_In593080351 ~x$r_buff0_thd0~0_Out593080351) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out593080351 0)) (or (and .cse0 (= ~x$w_buff0_used~0_In593080351 ~x$w_buff0_used~0_Out593080351)) (and (= ~x$w_buff0_used~0_Out593080351 0) .cse1 .cse2)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In593080351| ULTIMATE.start_assume_abort_if_not_~cond_Out593080351) (or (and .cse3 (= ~x$w_buff1_used~0_Out593080351 0) .cse4) (and (= ~x$w_buff1_used~0_In593080351 ~x$w_buff1_used~0_Out593080351) .cse5)) (or (and .cse0 (or (and (= ~x~0_In593080351 ~x~0_Out593080351) .cse5) (and .cse3 (= ~x$w_buff1~0_In593080351 ~x~0_Out593080351) .cse4))) (and .cse1 (= ~x$w_buff0~0_In593080351 ~x~0_Out593080351) .cse2)) (= ~x$r_buff1_thd0~0_Out593080351 ~x$r_buff1_thd0~0_In593080351)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In593080351, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In593080351, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In593080351|, ~x$w_buff1~0=~x$w_buff1~0_In593080351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In593080351, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In593080351, ~x~0=~x~0_In593080351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In593080351} OutVars{~x$w_buff0~0=~x$w_buff0~0_In593080351, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out593080351, ~x$w_buff1~0=~x$w_buff1~0_In593080351, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out593080351, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out593080351|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out593080351, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out593080351, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out593080351|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out593080351|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In593080351|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out593080351|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out593080351|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out593080351, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out593080351|, ~x~0=~x~0_Out593080351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 12:12:19,065 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,082 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,082 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,082 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,085 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,089 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,089 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,091 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,091 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,091 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,091 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,092 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,092 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,092 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,093 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,093 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:19,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:12:19 BasicIcfg [2020-10-16 12:12:19,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:12:19,204 INFO L168 Benchmark]: Toolchain (without parser) took 34567.04 ms. Allocated memory was 138.4 MB in the beginning and 583.0 MB in the end (delta: 444.6 MB). Free memory was 100.0 MB in the beginning and 187.9 MB in the end (delta: -87.9 MB). Peak memory consumption was 356.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,204 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.54 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 154.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.14 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,206 INFO L168 Benchmark]: Boogie Preprocessor took 47.73 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 147.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,210 INFO L168 Benchmark]: RCFGBuilder took 3534.97 ms. Allocated memory was 202.4 MB in the beginning and 252.7 MB in the end (delta: 50.3 MB). Free memory was 147.5 MB in the beginning and 111.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,211 INFO L168 Benchmark]: TraceAbstraction took 30064.90 ms. Allocated memory was 252.7 MB in the beginning and 583.0 MB in the end (delta: 330.3 MB). Free memory was 111.6 MB in the beginning and 187.9 MB in the end (delta: -76.3 MB). Peak memory consumption was 254.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,216 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.54 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 154.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.14 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.73 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 147.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3534.97 ms. Allocated memory was 202.4 MB in the beginning and 252.7 MB in the end (delta: 50.3 MB). Free memory was 147.5 MB in the beginning and 111.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30064.90 ms. Allocated memory was 252.7 MB in the beginning and 583.0 MB in the end (delta: 330.3 MB). Free memory was 111.6 MB in the beginning and 187.9 MB in the end (delta: -76.3 MB). Peak memory consumption was 254.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 811 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.9s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 4248 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2552; [L839] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2553; [L841] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2554; [L843] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.7s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 586 SDtfs, 1054 SDslu, 1641 SDs, 0 SdLazy, 2469 SolverSat, 648 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 1468 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 127111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...