/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/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:57:06,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:57:06,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:57:06,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:57:06,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:57:06,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:57:06,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:57:06,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:57:06,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:57:06,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:57:06,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:57:06,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:57:06,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:57:06,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:57:06,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:57:06,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:57:06,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:57:06,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:57:06,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:57:06,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:57:06,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:57:06,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:57:06,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:57:06,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:57:06,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:57:06,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:57:06,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:57:06,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:57:06,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:57:06,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:57:06,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:57:06,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:57:06,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:57:06,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:57:06,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:57:06,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:57:06,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:57:06,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:57:06,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:57:06,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:57:06,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:57:06,325 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 11:57:06,348 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:57:06,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:57:06,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:57:06,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:57:06,350 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:57:06,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:57:06,350 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:57:06,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:57:06,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:57:06,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:57:06,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:57:06,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:57:06,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:57:06,352 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:57:06,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:57:06,352 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:57:06,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:57:06,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:57:06,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:57:06,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:57:06,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:57:06,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:57:06,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:57:06,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 11:57:06,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:57:06,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:57:06,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:57:06,355 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 11:57:06,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:57:06,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:57:06,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:57:06,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:57:06,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:57:06,686 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:57:06,687 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-16 11:57:06,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f9511639/5deb15eb6da64e9ebffd2b27c0a79596/FLAGa7b06e093 [2020-10-16 11:57:07,310 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:57:07,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-16 11:57:07,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f9511639/5deb15eb6da64e9ebffd2b27c0a79596/FLAGa7b06e093 [2020-10-16 11:57:07,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3f9511639/5deb15eb6da64e9ebffd2b27c0a79596 [2020-10-16 11:57:07,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:57:07,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:57:07,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:57:07,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:57:07,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:57:07,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:57:07" (1/1) ... [2020-10-16 11:57:07,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489c61a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:07, skipping insertion in model container [2020-10-16 11:57:07,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:57:07" (1/1) ... [2020-10-16 11:57:07,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:57:07,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:57:08,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:57:08,336 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:57:08,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:57:08,487 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:57:08,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08 WrapperNode [2020-10-16 11:57:08,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:57:08,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:57:08,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:57:08,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:57:08,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:57:08,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:57:08,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:57:08,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:57:08,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (1/1) ... [2020-10-16 11:57:08,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:57:08,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:57:08,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:57:08,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:57:08,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (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 11:57:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:57:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:57:08,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:57:08,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:57:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:57:08,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:57:08,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:57:08,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:57:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:57:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:57:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:57:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:57:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:57:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:57:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:57:08,716 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 11:57:11,033 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:57:11,033 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:57:11,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:57:11 BoogieIcfgContainer [2020-10-16 11:57:11,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:57:11,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:57:11,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:57:11,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:57:11,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:57:07" (1/3) ... [2020-10-16 11:57:11,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1cc08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:57:11, skipping insertion in model container [2020-10-16 11:57:11,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:57:08" (2/3) ... [2020-10-16 11:57:11,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1cc08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:57:11, skipping insertion in model container [2020-10-16 11:57:11,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:57:11" (3/3) ... [2020-10-16 11:57:11,045 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2020-10-16 11:57:11,060 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:57:11,061 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:57:11,070 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:57:11,072 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:57:11,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,109 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,121 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,121 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,132 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:57:11,147 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:57:11,165 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:57:11,187 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:57:11,187 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:57:11,187 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 11:57:11,187 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:57:11,188 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:57:11,188 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:57:11,188 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:57:11,188 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:57:11,203 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 11:57:11,204 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-16 11:57:11,206 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-16 11:57:11,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-16 11:57:11,265 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-16 11:57:11,266 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:57:11,272 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 11:57:11,277 INFO L117 LiptonReduction]: Number of co-enabled transitions 2816 [2020-10-16 11:57:12,776 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 11:57:12,889 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 11:57:14,468 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-16 11:57:14,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 1] term [2020-10-16 11:57:14,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:57:14,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 11:57:14,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:57:15,604 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 156 DAG size of output: 127 [2020-10-16 11:57:16,718 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 235 DAG size of output: 194 [2020-10-16 11:57:16,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 1] term [2020-10-16 11:57:16,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:57:16,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 11:57:16,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:57:17,488 WARN L193 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 113 [2020-10-16 11:57:18,077 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 11:57:18,534 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 11:57:19,259 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-10-16 11:57:19,631 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-10-16 11:57:19,936 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 11:57:20,080 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 11:57:20,092 INFO L132 LiptonReduction]: Checked pairs total: 9296 [2020-10-16 11:57:20,092 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-16 11:57:20,099 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 35 transitions, 90 flow [2020-10-16 11:57:20,514 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5832 states. [2020-10-16 11:57:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states. [2020-10-16 11:57:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 11:57:20,523 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:20,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 11:57:20,525 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1158467632, now seen corresponding path program 1 times [2020-10-16 11:57:20,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:20,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583159307] [2020-10-16 11:57:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:20,777 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 11:57:20,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583159307] [2020-10-16 11:57:20,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:20,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:57:20,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206061854] [2020-10-16 11:57:20,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:57:20,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:57:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:57:20,805 INFO L87 Difference]: Start difference. First operand 5832 states. Second operand 3 states. [2020-10-16 11:57:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:21,006 INFO L93 Difference]: Finished difference Result 4862 states and 19480 transitions. [2020-10-16 11:57:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:57:21,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 11:57:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:21,070 INFO L225 Difference]: With dead ends: 4862 [2020-10-16 11:57:21,070 INFO L226 Difference]: Without dead ends: 3962 [2020-10-16 11:57:21,072 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 11:57:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-10-16 11:57:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2020-10-16 11:57:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2020-10-16 11:57:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15640 transitions. [2020-10-16 11:57:21,350 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15640 transitions. Word has length 5 [2020-10-16 11:57:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:21,351 INFO L481 AbstractCegarLoop]: Abstraction has 3962 states and 15640 transitions. [2020-10-16 11:57:21,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:57:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15640 transitions. [2020-10-16 11:57:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:57:21,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:21,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:21,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:57:21,355 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash -168156543, now seen corresponding path program 1 times [2020-10-16 11:57:21,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:21,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436230401] [2020-10-16 11:57:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:21,464 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 11:57:21,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436230401] [2020-10-16 11:57:21,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:21,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:57:21,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972152349] [2020-10-16 11:57:21,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:57:21,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:57:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:57:21,469 INFO L87 Difference]: Start difference. First operand 3962 states and 15640 transitions. Second operand 3 states. [2020-10-16 11:57:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:21,519 INFO L93 Difference]: Finished difference Result 3662 states and 14310 transitions. [2020-10-16 11:57:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:57:21,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:57:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:21,554 INFO L225 Difference]: With dead ends: 3662 [2020-10-16 11:57:21,554 INFO L226 Difference]: Without dead ends: 3662 [2020-10-16 11:57:21,555 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 11:57:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2020-10-16 11:57:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2020-10-16 11:57:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2020-10-16 11:57:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 14310 transitions. [2020-10-16 11:57:21,813 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 14310 transitions. Word has length 11 [2020-10-16 11:57:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:21,821 INFO L481 AbstractCegarLoop]: Abstraction has 3662 states and 14310 transitions. [2020-10-16 11:57:21,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:57:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 14310 transitions. [2020-10-16 11:57:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:57:21,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:21,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:21,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:57:21,829 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1622091736, now seen corresponding path program 1 times [2020-10-16 11:57:21,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:21,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058910479] [2020-10-16 11:57:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:21,921 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 11:57:21,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058910479] [2020-10-16 11:57:21,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:21,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:57:21,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940945725] [2020-10-16 11:57:21,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:57:21,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:57:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:57:21,924 INFO L87 Difference]: Start difference. First operand 3662 states and 14310 transitions. Second operand 3 states. [2020-10-16 11:57:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:22,004 INFO L93 Difference]: Finished difference Result 3622 states and 14128 transitions. [2020-10-16 11:57:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:57:22,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 11:57:22,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:22,039 INFO L225 Difference]: With dead ends: 3622 [2020-10-16 11:57:22,039 INFO L226 Difference]: Without dead ends: 3622 [2020-10-16 11:57:22,040 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 11:57:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2020-10-16 11:57:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2020-10-16 11:57:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2020-10-16 11:57:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 14128 transitions. [2020-10-16 11:57:22,203 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 14128 transitions. Word has length 13 [2020-10-16 11:57:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:22,204 INFO L481 AbstractCegarLoop]: Abstraction has 3622 states and 14128 transitions. [2020-10-16 11:57:22,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:57:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 14128 transitions. [2020-10-16 11:57:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:57:22,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:22,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:22,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:57:22,208 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1254763892, now seen corresponding path program 1 times [2020-10-16 11:57:22,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:22,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901342521] [2020-10-16 11:57:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:22,319 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 11:57:22,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901342521] [2020-10-16 11:57:22,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:22,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:57:22,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108663402] [2020-10-16 11:57:22,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:57:22,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:57:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:57:22,324 INFO L87 Difference]: Start difference. First operand 3622 states and 14128 transitions. Second operand 3 states. [2020-10-16 11:57:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:22,362 INFO L93 Difference]: Finished difference Result 3462 states and 13440 transitions. [2020-10-16 11:57:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:57:22,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-16 11:57:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:22,397 INFO L225 Difference]: With dead ends: 3462 [2020-10-16 11:57:22,398 INFO L226 Difference]: Without dead ends: 3462 [2020-10-16 11:57:22,398 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 11:57:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2020-10-16 11:57:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3462. [2020-10-16 11:57:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2020-10-16 11:57:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 13440 transitions. [2020-10-16 11:57:22,517 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 13440 transitions. Word has length 14 [2020-10-16 11:57:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:22,517 INFO L481 AbstractCegarLoop]: Abstraction has 3462 states and 13440 transitions. [2020-10-16 11:57:22,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:57:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 13440 transitions. [2020-10-16 11:57:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:57:22,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:22,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:22,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:57:22,522 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash -242993124, now seen corresponding path program 1 times [2020-10-16 11:57:22,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:22,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834233610] [2020-10-16 11:57:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:22,596 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 11:57:22,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834233610] [2020-10-16 11:57:22,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:22,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:57:22,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795093994] [2020-10-16 11:57:22,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:57:22,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:57:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:57:22,598 INFO L87 Difference]: Start difference. First operand 3462 states and 13440 transitions. Second operand 4 states. [2020-10-16 11:57:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:22,691 INFO L93 Difference]: Finished difference Result 3430 states and 13296 transitions. [2020-10-16 11:57:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:57:22,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:57:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:22,708 INFO L225 Difference]: With dead ends: 3430 [2020-10-16 11:57:22,708 INFO L226 Difference]: Without dead ends: 3430 [2020-10-16 11:57:22,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:57:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2020-10-16 11:57:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3430. [2020-10-16 11:57:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2020-10-16 11:57:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 13296 transitions. [2020-10-16 11:57:23,322 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 13296 transitions. Word has length 15 [2020-10-16 11:57:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:23,323 INFO L481 AbstractCegarLoop]: Abstraction has 3430 states and 13296 transitions. [2020-10-16 11:57:23,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:57:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 13296 transitions. [2020-10-16 11:57:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:57:23,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:23,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:23,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:57:23,328 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1057147592, now seen corresponding path program 1 times [2020-10-16 11:57:23,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:23,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523328034] [2020-10-16 11:57:23,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:23,442 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 11:57:23,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523328034] [2020-10-16 11:57:23,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:23,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:57:23,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058404165] [2020-10-16 11:57:23,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:57:23,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:23,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:57:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:57:23,445 INFO L87 Difference]: Start difference. First operand 3430 states and 13296 transitions. Second operand 5 states. [2020-10-16 11:57:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:23,553 INFO L93 Difference]: Finished difference Result 3414 states and 13216 transitions. [2020-10-16 11:57:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:23,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 11:57:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:23,571 INFO L225 Difference]: With dead ends: 3414 [2020-10-16 11:57:23,571 INFO L226 Difference]: Without dead ends: 3414 [2020-10-16 11:57:23,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:57:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2020-10-16 11:57:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3414. [2020-10-16 11:57:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2020-10-16 11:57:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 13216 transitions. [2020-10-16 11:57:23,694 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 13216 transitions. Word has length 16 [2020-10-16 11:57:23,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:23,695 INFO L481 AbstractCegarLoop]: Abstraction has 3414 states and 13216 transitions. [2020-10-16 11:57:23,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:57:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 13216 transitions. [2020-10-16 11:57:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:57:23,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:23,701 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 11:57:23,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:57:23,701 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash 617081770, now seen corresponding path program 1 times [2020-10-16 11:57:23,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:23,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436919485] [2020-10-16 11:57:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:23,801 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 11:57:23,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436919485] [2020-10-16 11:57:23,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:23,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:57:23,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410316044] [2020-10-16 11:57:23,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:57:23,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:57:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:57:23,803 INFO L87 Difference]: Start difference. First operand 3414 states and 13216 transitions. Second operand 5 states. [2020-10-16 11:57:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:23,931 INFO L93 Difference]: Finished difference Result 3446 states and 13338 transitions. [2020-10-16 11:57:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:23,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 11:57:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:23,948 INFO L225 Difference]: With dead ends: 3446 [2020-10-16 11:57:23,949 INFO L226 Difference]: Without dead ends: 3446 [2020-10-16 11:57:23,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:57:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2020-10-16 11:57:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3366. [2020-10-16 11:57:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2020-10-16 11:57:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 13016 transitions. [2020-10-16 11:57:24,073 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 13016 transitions. Word has length 17 [2020-10-16 11:57:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:24,074 INFO L481 AbstractCegarLoop]: Abstraction has 3366 states and 13016 transitions. [2020-10-16 11:57:24,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:57:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 13016 transitions. [2020-10-16 11:57:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:57:24,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:24,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:24,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:57:24,085 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1949665530, now seen corresponding path program 1 times [2020-10-16 11:57:24,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:24,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544208547] [2020-10-16 11:57:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:24,219 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 11:57:24,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544208547] [2020-10-16 11:57:24,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:24,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:57:24,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842404386] [2020-10-16 11:57:24,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:57:24,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:24,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:57:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:57:24,222 INFO L87 Difference]: Start difference. First operand 3366 states and 13016 transitions. Second operand 6 states. [2020-10-16 11:57:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:24,584 INFO L93 Difference]: Finished difference Result 4422 states and 17134 transitions. [2020-10-16 11:57:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:57:24,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:57:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:24,603 INFO L225 Difference]: With dead ends: 4422 [2020-10-16 11:57:24,604 INFO L226 Difference]: Without dead ends: 4422 [2020-10-16 11:57:24,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:57:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2020-10-16 11:57:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4230. [2020-10-16 11:57:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2020-10-16 11:57:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 16360 transitions. [2020-10-16 11:57:24,902 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 16360 transitions. Word has length 18 [2020-10-16 11:57:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:24,903 INFO L481 AbstractCegarLoop]: Abstraction has 4230 states and 16360 transitions. [2020-10-16 11:57:24,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:57:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 16360 transitions. [2020-10-16 11:57:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:57:24,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:24,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:24,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:57:24,914 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:24,915 INFO L82 PathProgramCache]: Analyzing trace with hash -458952755, now seen corresponding path program 1 times [2020-10-16 11:57:24,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:24,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633538873] [2020-10-16 11:57:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:25,148 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 11:57:25,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633538873] [2020-10-16 11:57:25,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:25,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:57:25,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507962145] [2020-10-16 11:57:25,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:57:25,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:25,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:57:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:57:25,150 INFO L87 Difference]: Start difference. First operand 4230 states and 16360 transitions. Second operand 6 states. [2020-10-16 11:57:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:25,315 INFO L93 Difference]: Finished difference Result 4262 states and 16464 transitions. [2020-10-16 11:57:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:25,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:57:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:25,330 INFO L225 Difference]: With dead ends: 4262 [2020-10-16 11:57:25,330 INFO L226 Difference]: Without dead ends: 4262 [2020-10-16 11:57:25,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:57:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-10-16 11:57:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2020-10-16 11:57:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2020-10-16 11:57:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16464 transitions. [2020-10-16 11:57:25,465 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 16464 transitions. Word has length 18 [2020-10-16 11:57:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:25,466 INFO L481 AbstractCegarLoop]: Abstraction has 4262 states and 16464 transitions. [2020-10-16 11:57:25,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:57:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 16464 transitions. [2020-10-16 11:57:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:57:25,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:25,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:25,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:57:25,475 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1989968945, now seen corresponding path program 1 times [2020-10-16 11:57:25,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:25,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293296763] [2020-10-16 11:57:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:25,616 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 11:57:25,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293296763] [2020-10-16 11:57:25,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:25,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:57:25,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236320955] [2020-10-16 11:57:25,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:57:25,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:57:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:57:25,619 INFO L87 Difference]: Start difference. First operand 4262 states and 16464 transitions. Second operand 6 states. [2020-10-16 11:57:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:25,774 INFO L93 Difference]: Finished difference Result 4294 states and 16568 transitions. [2020-10-16 11:57:25,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:25,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:57:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:25,789 INFO L225 Difference]: With dead ends: 4294 [2020-10-16 11:57:25,789 INFO L226 Difference]: Without dead ends: 4294 [2020-10-16 11:57:25,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:57:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2020-10-16 11:57:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 4246. [2020-10-16 11:57:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4246 states. [2020-10-16 11:57:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 16392 transitions. [2020-10-16 11:57:25,912 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 16392 transitions. Word has length 18 [2020-10-16 11:57:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:25,912 INFO L481 AbstractCegarLoop]: Abstraction has 4246 states and 16392 transitions. [2020-10-16 11:57:25,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:57:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 16392 transitions. [2020-10-16 11:57:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:57:25,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:25,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:25,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:57:25,922 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1988485657, now seen corresponding path program 1 times [2020-10-16 11:57:25,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:25,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414290433] [2020-10-16 11:57:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:26,024 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 11:57:26,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414290433] [2020-10-16 11:57:26,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:26,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:57:26,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569004048] [2020-10-16 11:57:26,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:57:26,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:57:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:57:26,026 INFO L87 Difference]: Start difference. First operand 4246 states and 16392 transitions. Second operand 6 states. [2020-10-16 11:57:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:26,226 INFO L93 Difference]: Finished difference Result 6850 states and 26206 transitions. [2020-10-16 11:57:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:57:26,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:57:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:26,245 INFO L225 Difference]: With dead ends: 6850 [2020-10-16 11:57:26,245 INFO L226 Difference]: Without dead ends: 4904 [2020-10-16 11:57:26,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:57:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2020-10-16 11:57:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4696. [2020-10-16 11:57:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2020-10-16 11:57:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 17444 transitions. [2020-10-16 11:57:26,455 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 17444 transitions. Word has length 18 [2020-10-16 11:57:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:26,455 INFO L481 AbstractCegarLoop]: Abstraction has 4696 states and 17444 transitions. [2020-10-16 11:57:26,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:57:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 17444 transitions. [2020-10-16 11:57:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:57:26,466 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:26,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:26,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:57:26,467 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1405351413, now seen corresponding path program 2 times [2020-10-16 11:57:26,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:26,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159031398] [2020-10-16 11:57:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:26,519 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 11:57:26,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159031398] [2020-10-16 11:57:26,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:26,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:57:26,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213368017] [2020-10-16 11:57:26,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:57:26,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:57:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:57:26,522 INFO L87 Difference]: Start difference. First operand 4696 states and 17444 transitions. Second operand 4 states. [2020-10-16 11:57:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:26,581 INFO L93 Difference]: Finished difference Result 6550 states and 24234 transitions. [2020-10-16 11:57:26,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:26,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-16 11:57:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:26,601 INFO L225 Difference]: With dead ends: 6550 [2020-10-16 11:57:26,601 INFO L226 Difference]: Without dead ends: 4852 [2020-10-16 11:57:26,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:57:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2020-10-16 11:57:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 3998. [2020-10-16 11:57:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3998 states. [2020-10-16 11:57:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 14580 transitions. [2020-10-16 11:57:26,733 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 14580 transitions. Word has length 18 [2020-10-16 11:57:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:26,734 INFO L481 AbstractCegarLoop]: Abstraction has 3998 states and 14580 transitions. [2020-10-16 11:57:26,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:57:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 14580 transitions. [2020-10-16 11:57:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:57:26,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:26,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:26,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:57:26,751 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1349738343, now seen corresponding path program 3 times [2020-10-16 11:57:26,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:26,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148788447] [2020-10-16 11:57:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:26,872 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 11:57:26,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148788447] [2020-10-16 11:57:26,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:26,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:57:26,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152608872] [2020-10-16 11:57:26,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:57:26,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:57:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:57:26,876 INFO L87 Difference]: Start difference. First operand 3998 states and 14580 transitions. Second operand 4 states. [2020-10-16 11:57:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:26,928 INFO L93 Difference]: Finished difference Result 4062 states and 13470 transitions. [2020-10-16 11:57:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:26,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-16 11:57:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:26,938 INFO L225 Difference]: With dead ends: 4062 [2020-10-16 11:57:26,939 INFO L226 Difference]: Without dead ends: 2958 [2020-10-16 11:57:26,939 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 11:57:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-10-16 11:57:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2020-10-16 11:57:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2020-10-16 11:57:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 9636 transitions. [2020-10-16 11:57:27,016 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 9636 transitions. Word has length 18 [2020-10-16 11:57:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:27,016 INFO L481 AbstractCegarLoop]: Abstraction has 2958 states and 9636 transitions. [2020-10-16 11:57:27,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:57:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 9636 transitions. [2020-10-16 11:57:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:57:27,022 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:27,022 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 11:57:27,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:57:27,022 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1773750894, now seen corresponding path program 1 times [2020-10-16 11:57:27,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:27,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634269599] [2020-10-16 11:57:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:27,137 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 11:57:27,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634269599] [2020-10-16 11:57:27,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:27,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:57:27,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058926632] [2020-10-16 11:57:27,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:57:27,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:57:27,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:57:27,140 INFO L87 Difference]: Start difference. First operand 2958 states and 9636 transitions. Second operand 5 states. [2020-10-16 11:57:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:27,198 INFO L93 Difference]: Finished difference Result 2531 states and 7689 transitions. [2020-10-16 11:57:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:57:27,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-16 11:57:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:27,205 INFO L225 Difference]: With dead ends: 2531 [2020-10-16 11:57:27,206 INFO L226 Difference]: Without dead ends: 1913 [2020-10-16 11:57:27,207 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 11:57:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2020-10-16 11:57:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1781. [2020-10-16 11:57:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2020-10-16 11:57:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 5294 transitions. [2020-10-16 11:57:27,248 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 5294 transitions. Word has length 19 [2020-10-16 11:57:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:27,249 INFO L481 AbstractCegarLoop]: Abstraction has 1781 states and 5294 transitions. [2020-10-16 11:57:27,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:57:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 5294 transitions. [2020-10-16 11:57:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:57:27,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:27,254 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, 1] [2020-10-16 11:57:27,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:57:27,255 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash -642367673, now seen corresponding path program 1 times [2020-10-16 11:57:27,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:27,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113448563] [2020-10-16 11:57:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:27,544 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 11:57:27,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113448563] [2020-10-16 11:57:27,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:27,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:57:27,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181617822] [2020-10-16 11:57:27,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:57:27,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:27,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:57:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:57:27,547 INFO L87 Difference]: Start difference. First operand 1781 states and 5294 transitions. Second operand 6 states. [2020-10-16 11:57:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:27,733 INFO L93 Difference]: Finished difference Result 1777 states and 5282 transitions. [2020-10-16 11:57:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:27,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-16 11:57:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:27,741 INFO L225 Difference]: With dead ends: 1777 [2020-10-16 11:57:27,742 INFO L226 Difference]: Without dead ends: 1777 [2020-10-16 11:57:27,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:57:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2020-10-16 11:57:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1697. [2020-10-16 11:57:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1697 states. [2020-10-16 11:57:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 5062 transitions. [2020-10-16 11:57:27,795 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 5062 transitions. Word has length 22 [2020-10-16 11:57:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:27,796 INFO L481 AbstractCegarLoop]: Abstraction has 1697 states and 5062 transitions. [2020-10-16 11:57:27,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:57:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 5062 transitions. [2020-10-16 11:57:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:57:27,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:27,805 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, 1] [2020-10-16 11:57:27,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:57:27,805 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash -291029716, now seen corresponding path program 1 times [2020-10-16 11:57:27,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:27,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534612491] [2020-10-16 11:57:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:27,947 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 11:57:27,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534612491] [2020-10-16 11:57:27,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:27,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:57:27,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332651814] [2020-10-16 11:57:27,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:57:27,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:27,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:57:27,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:57:27,954 INFO L87 Difference]: Start difference. First operand 1697 states and 5062 transitions. Second operand 6 states. [2020-10-16 11:57:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:28,037 INFO L93 Difference]: Finished difference Result 1523 states and 4528 transitions. [2020-10-16 11:57:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:57:28,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-16 11:57:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:28,044 INFO L225 Difference]: With dead ends: 1523 [2020-10-16 11:57:28,044 INFO L226 Difference]: Without dead ends: 1372 [2020-10-16 11:57:28,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:57:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-10-16 11:57:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1304. [2020-10-16 11:57:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2020-10-16 11:57:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 3983 transitions. [2020-10-16 11:57:28,083 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 3983 transitions. Word has length 22 [2020-10-16 11:57:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:28,084 INFO L481 AbstractCegarLoop]: Abstraction has 1304 states and 3983 transitions. [2020-10-16 11:57:28,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:57:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 3983 transitions. [2020-10-16 11:57:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:57:28,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:28,089 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, 1, 1, 1, 1] [2020-10-16 11:57:28,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:57:28,089 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2101077513, now seen corresponding path program 1 times [2020-10-16 11:57:28,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:28,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397302594] [2020-10-16 11:57:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:28,179 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 11:57:28,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397302594] [2020-10-16 11:57:28,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:28,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:57:28,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027323620] [2020-10-16 11:57:28,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:57:28,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:57:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:57:28,181 INFO L87 Difference]: Start difference. First operand 1304 states and 3983 transitions. Second operand 4 states. [2020-10-16 11:57:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:28,237 INFO L93 Difference]: Finished difference Result 1702 states and 5080 transitions. [2020-10-16 11:57:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:28,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-16 11:57:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:28,243 INFO L225 Difference]: With dead ends: 1702 [2020-10-16 11:57:28,243 INFO L226 Difference]: Without dead ends: 1207 [2020-10-16 11:57:28,244 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 11:57:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-10-16 11:57:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1204. [2020-10-16 11:57:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2020-10-16 11:57:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 3526 transitions. [2020-10-16 11:57:28,270 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 3526 transitions. Word has length 25 [2020-10-16 11:57:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:28,271 INFO L481 AbstractCegarLoop]: Abstraction has 1204 states and 3526 transitions. [2020-10-16 11:57:28,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:57:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 3526 transitions. [2020-10-16 11:57:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:57:28,274 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:28,275 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, 1, 1, 1, 1] [2020-10-16 11:57:28,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:57:28,275 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1198172463, now seen corresponding path program 2 times [2020-10-16 11:57:28,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:28,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860391906] [2020-10-16 11:57:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:28,387 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 11:57:28,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860391906] [2020-10-16 11:57:28,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:28,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:57:28,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936541745] [2020-10-16 11:57:28,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:57:28,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:57:28,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:57:28,391 INFO L87 Difference]: Start difference. First operand 1204 states and 3526 transitions. Second operand 7 states. [2020-10-16 11:57:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:28,490 INFO L93 Difference]: Finished difference Result 1175 states and 3468 transitions. [2020-10-16 11:57:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:57:28,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-16 11:57:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:28,493 INFO L225 Difference]: With dead ends: 1175 [2020-10-16 11:57:28,493 INFO L226 Difference]: Without dead ends: 590 [2020-10-16 11:57:28,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:57:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-10-16 11:57:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2020-10-16 11:57:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2020-10-16 11:57:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1733 transitions. [2020-10-16 11:57:28,506 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1733 transitions. Word has length 25 [2020-10-16 11:57:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:28,506 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 1733 transitions. [2020-10-16 11:57:28,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:57:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1733 transitions. [2020-10-16 11:57:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:57:28,508 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:28,508 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:28,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 11:57:28,509 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1025328176, now seen corresponding path program 1 times [2020-10-16 11:57:28,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:28,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281752045] [2020-10-16 11:57:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:28,571 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 11:57:28,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281752045] [2020-10-16 11:57:28,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:28,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:57:28,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150543123] [2020-10-16 11:57:28,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:57:28,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:28,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:57:28,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:57:28,574 INFO L87 Difference]: Start difference. First operand 590 states and 1733 transitions. Second operand 4 states. [2020-10-16 11:57:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:28,593 INFO L93 Difference]: Finished difference Result 700 states and 2032 transitions. [2020-10-16 11:57:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:57:28,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-16 11:57:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:28,595 INFO L225 Difference]: With dead ends: 700 [2020-10-16 11:57:28,595 INFO L226 Difference]: Without dead ends: 230 [2020-10-16 11:57:28,596 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 11:57:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-16 11:57:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2020-10-16 11:57:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-16 11:57:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 581 transitions. [2020-10-16 11:57:28,601 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 581 transitions. Word has length 29 [2020-10-16 11:57:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:28,601 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 581 transitions. [2020-10-16 11:57:28,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:57:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 581 transitions. [2020-10-16 11:57:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:57:28,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:28,602 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:28,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 11:57:28,602 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash -261830384, now seen corresponding path program 2 times [2020-10-16 11:57:28,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:28,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160161336] [2020-10-16 11:57:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:57:28,820 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 11:57:28,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160161336] [2020-10-16 11:57:28,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:57:28,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:57:28,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116138593] [2020-10-16 11:57:28,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:57:28,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:57:28,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:57:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:57:28,822 INFO L87 Difference]: Start difference. First operand 230 states and 581 transitions. Second operand 7 states. [2020-10-16 11:57:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:57:28,981 INFO L93 Difference]: Finished difference Result 304 states and 769 transitions. [2020-10-16 11:57:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:57:28,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-10-16 11:57:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:57:28,983 INFO L225 Difference]: With dead ends: 304 [2020-10-16 11:57:28,983 INFO L226 Difference]: Without dead ends: 222 [2020-10-16 11:57:28,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:57:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-10-16 11:57:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 186. [2020-10-16 11:57:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-16 11:57:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 433 transitions. [2020-10-16 11:57:28,988 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 433 transitions. Word has length 29 [2020-10-16 11:57:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:57:28,988 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 433 transitions. [2020-10-16 11:57:28,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:57:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 433 transitions. [2020-10-16 11:57:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-16 11:57:28,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:57:28,990 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:57:28,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 11:57:28,990 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:57:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:57:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 431410192, now seen corresponding path program 3 times [2020-10-16 11:57:28,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:57:28,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569887790] [2020-10-16 11:57:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:57:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:57:29,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:57:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:57:29,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:57:29,176 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:57:29,177 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:57:29,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 11:57:29,179 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:57:29,210 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L857-->L865: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In-1783416443 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-1783416443 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-1783416443 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-1783416443 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_Out-1783416443 ~x$r_buff1_thd0~0_In-1783416443) (= ~x$r_buff0_thd0~0_In-1783416443 ~x$r_buff0_thd0~0_Out-1783416443) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1783416443| (mod ~main$tmp_guard0~0_In-1783416443 256)) (or (and .cse0 (= ~x$w_buff1_used~0_In-1783416443 ~x$w_buff1_used~0_Out-1783416443)) (and .cse1 (= ~x$w_buff1_used~0_Out-1783416443 0) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1783416443 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1783416443 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1783416443|) (or (and .cse3 .cse4 (= ~x$w_buff0~0_In-1783416443 ~x~0_Out-1783416443)) (and (or (and .cse1 (= ~x$w_buff1~0_In-1783416443 ~x~0_Out-1783416443) .cse2) (and .cse0 (= ~x~0_In-1783416443 ~x~0_Out-1783416443))) .cse5)) (or (and (= ~x$w_buff0_used~0_Out-1783416443 0) .cse3 .cse4) (and .cse5 (= ~x$w_buff0_used~0_Out-1783416443 ~x$w_buff0_used~0_In-1783416443)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1783416443, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1783416443, ~x$w_buff1~0=~x$w_buff1~0_In-1783416443, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1783416443, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1783416443, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1783416443, ~x~0=~x~0_In-1783416443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1783416443} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1783416443, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1783416443, ~x$w_buff1~0=~x$w_buff1~0_In-1783416443, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1783416443|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1783416443, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1783416443, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1783416443, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1783416443|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1783416443|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1783416443|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1783416443, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1783416443|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1783416443|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1783416443|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1783416443, ~x~0=~x~0_Out-1783416443} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-16 11:57:29,228 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 11:57:29,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,230 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 11:57:29,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,231 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 11:57:29,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,231 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 11:57:29,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,232 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 11:57:29,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,232 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 11:57:29,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,236 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 11:57:29,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,237 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 11:57:29,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,237 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 11:57:29,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,238 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 11:57:29,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,238 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 11:57:29,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,239 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 11:57:29,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,240 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 11:57:29,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,240 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 11:57:29,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,241 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 11:57:29,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,241 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 11:57:29,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,241 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 11:57:29,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,242 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 11:57:29,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,242 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 11:57:29,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,249 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 11:57:29,250 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,250 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 11:57:29,250 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,251 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 11:57:29,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,251 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 11:57:29,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,253 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 11:57:29,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,254 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 11:57:29,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,254 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 11:57:29,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,255 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 11:57:29,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,255 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 11:57:29,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,256 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 11:57:29,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,256 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 11:57:29,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,257 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 11:57:29,257 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,257 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 11:57:29,257 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,258 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 11:57:29,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,258 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 11:57:29,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,259 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 11:57:29,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:57:29,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:57:29 BasicIcfg [2020-10-16 11:57:29,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:57:29,377 INFO L168 Benchmark]: Toolchain (without parser) took 21755.07 ms. Allocated memory was 145.8 MB in the beginning and 646.4 MB in the end (delta: 500.7 MB). Free memory was 100.4 MB in the beginning and 373.8 MB in the end (delta: -273.5 MB). Peak memory consumption was 227.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:57:29,378 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:57:29,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.99 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 100.1 MB in the beginning and 154.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:57:29,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.79 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:57:29,379 INFO L168 Benchmark]: Boogie Preprocessor took 42.84 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:57:29,380 INFO L168 Benchmark]: RCFGBuilder took 2411.72 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 149.4 MB in the beginning and 143.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2020-10-16 11:57:29,381 INFO L168 Benchmark]: TraceAbstraction took 18338.62 ms. Allocated memory was 249.0 MB in the beginning and 646.4 MB in the end (delta: 397.4 MB). Free memory was 143.0 MB in the beginning and 373.8 MB in the end (delta: -230.8 MB). Peak memory consumption was 166.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:57:29,383 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.51 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.99 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 100.1 MB in the beginning and 154.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.79 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.84 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2411.72 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 149.4 MB in the beginning and 143.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18338.62 ms. Allocated memory was 249.0 MB in the beginning and 646.4 MB in the end (delta: 397.4 MB). Free memory was 143.0 MB in the beginning and 373.8 MB in the end (delta: -230.8 MB). Peak memory consumption was 166.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1423 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 155 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 126 PlacesBefore, 48 PlacesAfterwards, 115 TransitionsBefore, 35 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 9296 MoverChecksTotal - CounterExampleResult [Line: 7]: 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_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L847] 0 pthread_t t145; [L848] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L849] 0 pthread_t t146; [L850] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L851] 0 pthread_t t147; [L852] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L853] 0 pthread_t t148; [L854] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L773] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L796] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L802] 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) [L802] 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) [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 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 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L806] 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 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L816] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L819] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L822] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L743] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L829] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L779] 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) [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L779] 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) [L779] 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) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 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 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L832] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 4 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L871] 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) [L871] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 655 SDtfs, 1092 SDslu, 1080 SDs, 0 SdLazy, 470 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5832occurred 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: 2.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 1701 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 58407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...