/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/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:02:38,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:02:38,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:02:38,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:02:38,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:02:38,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:02:38,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:02:38,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:02:38,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:02:38,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:02:38,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:02:38,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:02:38,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:02:38,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:02:39,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:02:39,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:02:39,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:02:39,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:02:39,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:02:39,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:02:39,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:02:39,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:02:39,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:02:39,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:02:39,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:02:39,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:02:39,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:02:39,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:02:39,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:02:39,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:02:39,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:02:39,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:02:39,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:02:39,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:02:39,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:02:39,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:02:39,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:02:39,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:02:39,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:02:39,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:02:39,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:02:39,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:02:39,074 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:02:39,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:02:39,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:02:39,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:02:39,076 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:02:39,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:02:39,076 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:02:39,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:02:39,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:02:39,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:02:39,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:02:39,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:02:39,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:02:39,079 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:02:39,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:02:39,079 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:02:39,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:02:39,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:02:39,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:02:39,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:02:39,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:02:39,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:02:39,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:02:39,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:02:39,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:02:39,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:02:39,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:02:39,081 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:02:39,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:02:39,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:02:39,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:02:39,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:02:39,376 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:02:39,378 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:02:39,379 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2020-10-16 12:02:39,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9dd46c5d7/8089b5ce0f40469a93503f7545b32c98/FLAG4d3200d6c [2020-10-16 12:02:39,943 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:02:39,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2020-10-16 12:02:39,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9dd46c5d7/8089b5ce0f40469a93503f7545b32c98/FLAG4d3200d6c [2020-10-16 12:02:40,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9dd46c5d7/8089b5ce0f40469a93503f7545b32c98 [2020-10-16 12:02:40,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:02:40,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:02:40,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:02:40,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:02:40,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:02:40,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:40,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72794db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40, skipping insertion in model container [2020-10-16 12:02:40,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:40,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:02:40,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:02:40,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:02:40,783 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:02:40,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:02:40,925 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:02:40,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40 WrapperNode [2020-10-16 12:02:40,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:02:40,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:02:40,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:02:40,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:02:40,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:40,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:40,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:02:40,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:02:40,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:02:40,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:02:41,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... [2020-10-16 12:02:41,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:02:41,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:02:41,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:02:41,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:02:41,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:02:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:02:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:02:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:02:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:02:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:02:41,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:02:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:02:41,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:02:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:02:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:02:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:02:41,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:02:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:02:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:02:41,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:02:41,130 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:02:43,208 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:02:43,208 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:02:43,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:43 BoogieIcfgContainer [2020-10-16 12:02:43,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:02:43,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:02:43,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:02:43,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:02:43,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:02:40" (1/3) ... [2020-10-16 12:02:43,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b983b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:43, skipping insertion in model container [2020-10-16 12:02:43,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:40" (2/3) ... [2020-10-16 12:02:43,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b983b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:43, skipping insertion in model container [2020-10-16 12:02:43,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:43" (3/3) ... [2020-10-16 12:02:43,219 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2020-10-16 12:02:43,231 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:02:43,231 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:02:43,239 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:02:43,240 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:02:43,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,277 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,280 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,280 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,294 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,294 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,297 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,298 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,300 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:43,302 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:02:43,316 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:02:43,336 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:02:43,336 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:02:43,336 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:02:43,336 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:02:43,337 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:02:43,337 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:02:43,337 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:02:43,337 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:02:43,351 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:02:43,351 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-16 12:02:43,354 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-16 12:02:43,356 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 12:02:43,408 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 12:02:43,408 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:02:43,414 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 12:02:43,419 INFO L117 LiptonReduction]: Number of co-enabled transitions 2670 [2020-10-16 12:02:43,870 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:02:44,000 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:02:45,432 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:02:45,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:02:45,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:02:45,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:02:45,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:02:46,261 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 12:02:46,906 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:02:47,044 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:02:47,983 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-16 12:02:48,381 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 12:02:49,427 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 12:02:49,753 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:02:50,255 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 12:02:50,380 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 12:02:51,159 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-16 12:02:51,485 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:02:51,636 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 12:02:51,765 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 12:02:51,774 INFO L132 LiptonReduction]: Checked pairs total: 7908 [2020-10-16 12:02:51,774 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-16 12:02:51,780 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-16 12:02:52,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-16 12:02:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-16 12:02:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:02:52,040 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:52,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:52,041 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2123721585, now seen corresponding path program 1 times [2020-10-16 12:02:52,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:52,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552373351] [2020-10-16 12:02:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:52,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552373351] [2020-10-16 12:02:52,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:52,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:52,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672290087] [2020-10-16 12:02:52,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:52,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:52,322 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-16 12:02:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:52,456 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-16 12:02:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:52,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:02:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:52,501 INFO L225 Difference]: With dead ends: 3250 [2020-10-16 12:02:52,501 INFO L226 Difference]: Without dead ends: 2650 [2020-10-16 12:02:52,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-16 12:02:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-16 12:02:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-16 12:02:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-16 12:02:52,715 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-16 12:02:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:52,716 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-16 12:02:52,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-16 12:02:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:02:52,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:52,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:52,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:02:52,720 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash -323053806, now seen corresponding path program 1 times [2020-10-16 12:02:52,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:52,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940105173] [2020-10-16 12:02:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:52,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940105173] [2020-10-16 12:02:52,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:52,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:52,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191194970] [2020-10-16 12:02:52,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:52,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:52,820 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-16 12:02:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:52,862 INFO L93 Difference]: Finished difference Result 2590 states and 9950 transitions. [2020-10-16 12:02:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:52,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:02:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:52,955 INFO L225 Difference]: With dead ends: 2590 [2020-10-16 12:02:52,955 INFO L226 Difference]: Without dead ends: 2590 [2020-10-16 12:02:52,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2020-10-16 12:02:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2020-10-16 12:02:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2020-10-16 12:02:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9950 transitions. [2020-10-16 12:02:53,049 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 9950 transitions. Word has length 11 [2020-10-16 12:02:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:53,050 INFO L481 AbstractCegarLoop]: Abstraction has 2590 states and 9950 transitions. [2020-10-16 12:02:53,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 9950 transitions. [2020-10-16 12:02:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:02:53,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:53,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:53,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:02:53,054 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -615067811, now seen corresponding path program 1 times [2020-10-16 12:02:53,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:53,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557719943] [2020-10-16 12:02:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:53,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557719943] [2020-10-16 12:02:53,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:53,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734010309] [2020-10-16 12:02:53,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:53,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:53,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:53,130 INFO L87 Difference]: Start difference. First operand 2590 states and 9950 transitions. Second operand 3 states. [2020-10-16 12:02:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:53,162 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-10-16 12:02:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:53,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:02:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:53,186 INFO L225 Difference]: With dead ends: 2410 [2020-10-16 12:02:53,186 INFO L226 Difference]: Without dead ends: 2410 [2020-10-16 12:02:53,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-16 12:02:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-16 12:02:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:02:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-10-16 12:02:53,275 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 12 [2020-10-16 12:02:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:53,276 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-10-16 12:02:53,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-10-16 12:02:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:02:53,282 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:53,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:53,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:02:53,282 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1639228837, now seen corresponding path program 1 times [2020-10-16 12:02:53,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:53,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410339227] [2020-10-16 12:02:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:53,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410339227] [2020-10-16 12:02:53,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:53,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:53,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520938912] [2020-10-16 12:02:53,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:53,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:53,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:53,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:53,413 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states. [2020-10-16 12:02:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:53,475 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-16 12:02:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:53,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-16 12:02:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:53,496 INFO L225 Difference]: With dead ends: 2386 [2020-10-16 12:02:53,496 INFO L226 Difference]: Without dead ends: 2386 [2020-10-16 12:02:53,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-16 12:02:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-16 12:02:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-16 12:02:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-16 12:02:53,577 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-16 12:02:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:53,577 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-16 12:02:53,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-16 12:02:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:02:53,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:53,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:53,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:02:53,582 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -280913355, now seen corresponding path program 1 times [2020-10-16 12:02:53,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:53,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271394798] [2020-10-16 12:02:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:53,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271394798] [2020-10-16 12:02:53,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:53,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:53,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012799937] [2020-10-16 12:02:53,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:53,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:53,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:53,683 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-16 12:02:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:53,780 INFO L93 Difference]: Finished difference Result 2378 states and 9024 transitions. [2020-10-16 12:02:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:53,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:02:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:53,800 INFO L225 Difference]: With dead ends: 2378 [2020-10-16 12:02:53,801 INFO L226 Difference]: Without dead ends: 2378 [2020-10-16 12:02:53,801 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 12:02:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-10-16 12:02:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2338. [2020-10-16 12:02:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-10-16 12:02:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions. [2020-10-16 12:02:53,873 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15 [2020-10-16 12:02:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:53,873 INFO L481 AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions. [2020-10-16 12:02:53,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions. [2020-10-16 12:02:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:02:53,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:53,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:53,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:02:53,877 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash -724084415, now seen corresponding path program 1 times [2020-10-16 12:02:53,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:53,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285732075] [2020-10-16 12:02:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:54,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285732075] [2020-10-16 12:02:54,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:54,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:54,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029855910] [2020-10-16 12:02:54,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:54,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:54,146 INFO L87 Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 5 states. [2020-10-16 12:02:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:54,250 INFO L93 Difference]: Finished difference Result 2402 states and 9110 transitions. [2020-10-16 12:02:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:54,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:02:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:54,262 INFO L225 Difference]: With dead ends: 2402 [2020-10-16 12:02:54,262 INFO L226 Difference]: Without dead ends: 2402 [2020-10-16 12:02:54,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-10-16 12:02:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2402. [2020-10-16 12:02:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2020-10-16 12:02:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 9110 transitions. [2020-10-16 12:02:54,334 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 9110 transitions. Word has length 15 [2020-10-16 12:02:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:54,335 INFO L481 AbstractCegarLoop]: Abstraction has 2402 states and 9110 transitions. [2020-10-16 12:02:54,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 9110 transitions. [2020-10-16 12:02:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:02:54,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:54,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:54,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:02:54,339 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash -723514325, now seen corresponding path program 2 times [2020-10-16 12:02:54,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:54,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087671071] [2020-10-16 12:02:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:54,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087671071] [2020-10-16 12:02:54,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:54,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:54,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526946669] [2020-10-16 12:02:54,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:54,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:54,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:54,486 INFO L87 Difference]: Start difference. First operand 2402 states and 9110 transitions. Second operand 5 states. [2020-10-16 12:02:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:54,551 INFO L93 Difference]: Finished difference Result 2474 states and 9374 transitions. [2020-10-16 12:02:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:54,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:02:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:54,563 INFO L225 Difference]: With dead ends: 2474 [2020-10-16 12:02:54,563 INFO L226 Difference]: Without dead ends: 2474 [2020-10-16 12:02:54,563 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 12:02:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2020-10-16 12:02:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2410. [2020-10-16 12:02:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:02:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-16 12:02:54,633 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-10-16 12:02:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:54,634 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-16 12:02:54,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-16 12:02:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:02:54,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:54,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:54,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:02:54,638 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash -118950223, now seen corresponding path program 1 times [2020-10-16 12:02:54,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:54,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139642335] [2020-10-16 12:02:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:54,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139642335] [2020-10-16 12:02:54,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:54,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:54,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142544307] [2020-10-16 12:02:54,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:54,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:54,795 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-10-16 12:02:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:54,924 INFO L93 Difference]: Finished difference Result 2610 states and 9960 transitions. [2020-10-16 12:02:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:54,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:02:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:54,939 INFO L225 Difference]: With dead ends: 2610 [2020-10-16 12:02:54,939 INFO L226 Difference]: Without dead ends: 2610 [2020-10-16 12:02:54,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-16 12:02:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-16 12:02:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-16 12:02:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-16 12:02:55,021 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-16 12:02:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:55,022 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-16 12:02:55,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-16 12:02:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:02:55,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:55,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:55,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:02:55,027 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash -118380133, now seen corresponding path program 2 times [2020-10-16 12:02:55,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:55,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103651682] [2020-10-16 12:02:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:55,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103651682] [2020-10-16 12:02:55,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:55,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:55,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378383490] [2020-10-16 12:02:55,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:55,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:55,237 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-16 12:02:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:55,516 INFO L93 Difference]: Finished difference Result 2970 states and 11282 transitions. [2020-10-16 12:02:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:55,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:02:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:55,530 INFO L225 Difference]: With dead ends: 2970 [2020-10-16 12:02:55,530 INFO L226 Difference]: Without dead ends: 2970 [2020-10-16 12:02:55,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-10-16 12:02:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2762. [2020-10-16 12:02:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-16 12:02:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions. [2020-10-16 12:02:55,621 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 16 [2020-10-16 12:02:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:55,622 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions. [2020-10-16 12:02:55,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions. [2020-10-16 12:02:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:55,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:55,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:55,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:02:55,631 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash 605420232, now seen corresponding path program 1 times [2020-10-16 12:02:55,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:55,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068681721] [2020-10-16 12:02:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:55,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068681721] [2020-10-16 12:02:55,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:55,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:55,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256519837] [2020-10-16 12:02:55,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:02:55,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:02:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:55,915 INFO L87 Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states. [2020-10-16 12:02:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:56,116 INFO L93 Difference]: Finished difference Result 3282 states and 12440 transitions. [2020-10-16 12:02:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:02:56,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:02:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:56,132 INFO L225 Difference]: With dead ends: 3282 [2020-10-16 12:02:56,133 INFO L226 Difference]: Without dead ends: 3282 [2020-10-16 12:02:56,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2020-10-16 12:02:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2962. [2020-10-16 12:02:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2962 states. [2020-10-16 12:02:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 11256 transitions. [2020-10-16 12:02:56,226 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 11256 transitions. Word has length 17 [2020-10-16 12:02:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:56,227 INFO L481 AbstractCegarLoop]: Abstraction has 2962 states and 11256 transitions. [2020-10-16 12:02:56,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:02:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 11256 transitions. [2020-10-16 12:02:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:56,236 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:56,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:56,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:02:56,237 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 625180872, now seen corresponding path program 2 times [2020-10-16 12:02:56,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:56,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967769277] [2020-10-16 12:02:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:56,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967769277] [2020-10-16 12:02:56,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:56,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:56,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591897329] [2020-10-16 12:02:56,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:02:56,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:02:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:56,511 INFO L87 Difference]: Start difference. First operand 2962 states and 11256 transitions. Second operand 7 states. [2020-10-16 12:02:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:56,681 INFO L93 Difference]: Finished difference Result 3434 states and 12934 transitions. [2020-10-16 12:02:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:56,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:02:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:56,695 INFO L225 Difference]: With dead ends: 3434 [2020-10-16 12:02:56,695 INFO L226 Difference]: Without dead ends: 3434 [2020-10-16 12:02:56,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2020-10-16 12:02:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 2946. [2020-10-16 12:02:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2020-10-16 12:02:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 11196 transitions. [2020-10-16 12:02:56,860 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 11196 transitions. Word has length 17 [2020-10-16 12:02:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:56,861 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 11196 transitions. [2020-10-16 12:02:56,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:02:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 11196 transitions. [2020-10-16 12:02:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:56,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:56,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:56,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:02:56,867 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1081719962, now seen corresponding path program 1 times [2020-10-16 12:02:56,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:56,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633249698] [2020-10-16 12:02:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:57,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633249698] [2020-10-16 12:02:57,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:57,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:57,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162862733] [2020-10-16 12:02:57,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:57,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:57,121 INFO L87 Difference]: Start difference. First operand 2946 states and 11196 transitions. Second operand 6 states. [2020-10-16 12:02:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:57,222 INFO L93 Difference]: Finished difference Result 2922 states and 11096 transitions. [2020-10-16 12:02:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:57,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:02:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:57,236 INFO L225 Difference]: With dead ends: 2922 [2020-10-16 12:02:57,236 INFO L226 Difference]: Without dead ends: 2922 [2020-10-16 12:02:57,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 12:02:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-10-16 12:02:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2020-10-16 12:02:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2020-10-16 12:02:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 11096 transitions. [2020-10-16 12:02:57,324 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 11096 transitions. Word has length 17 [2020-10-16 12:02:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:57,325 INFO L481 AbstractCegarLoop]: Abstraction has 2922 states and 11096 transitions. [2020-10-16 12:02:57,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 11096 transitions. [2020-10-16 12:02:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:57,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:57,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:57,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:02:57,331 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash -120602720, now seen corresponding path program 1 times [2020-10-16 12:02:57,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:57,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147477300] [2020-10-16 12:02:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:57,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147477300] [2020-10-16 12:02:57,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:57,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:57,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633381866] [2020-10-16 12:02:57,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:57,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:57,386 INFO L87 Difference]: Start difference. First operand 2922 states and 11096 transitions. Second operand 4 states. [2020-10-16 12:02:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:57,423 INFO L93 Difference]: Finished difference Result 4050 states and 15178 transitions. [2020-10-16 12:02:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:57,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-16 12:02:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:57,447 INFO L225 Difference]: With dead ends: 4050 [2020-10-16 12:02:57,447 INFO L226 Difference]: Without dead ends: 2754 [2020-10-16 12:02:57,448 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 12:02:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2020-10-16 12:02:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2634. [2020-10-16 12:02:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2020-10-16 12:02:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 9488 transitions. [2020-10-16 12:02:57,511 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 9488 transitions. Word has length 17 [2020-10-16 12:02:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:57,511 INFO L481 AbstractCegarLoop]: Abstraction has 2634 states and 9488 transitions. [2020-10-16 12:02:57,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 9488 transitions. [2020-10-16 12:02:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:57,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:57,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:57,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:02:57,517 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -128229216, now seen corresponding path program 3 times [2020-10-16 12:02:57,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:57,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52482877] [2020-10-16 12:02:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:57,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 12:02:57,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52482877] [2020-10-16 12:02:57,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:57,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:57,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107529104] [2020-10-16 12:02:57,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:02:57,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:02:57,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:57,804 INFO L87 Difference]: Start difference. First operand 2634 states and 9488 transitions. Second operand 7 states. [2020-10-16 12:02:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:57,952 INFO L93 Difference]: Finished difference Result 3322 states and 11668 transitions. [2020-10-16 12:02:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:02:57,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:02:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:57,961 INFO L225 Difference]: With dead ends: 3322 [2020-10-16 12:02:57,961 INFO L226 Difference]: Without dead ends: 2914 [2020-10-16 12:02:57,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-10-16 12:02:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2482. [2020-10-16 12:02:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-10-16 12:02:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 8858 transitions. [2020-10-16 12:02:58,024 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 8858 transitions. Word has length 17 [2020-10-16 12:02:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,024 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 8858 transitions. [2020-10-16 12:02:58,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:02:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 8858 transitions. [2020-10-16 12:02:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:58,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:58,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:02:58,030 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash -210545998, now seen corresponding path program 2 times [2020-10-16 12:02:58,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919363305] [2020-10-16 12:02:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:58,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919363305] [2020-10-16 12:02:58,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:58,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:58,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650501068] [2020-10-16 12:02:58,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:58,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:58,078 INFO L87 Difference]: Start difference. First operand 2482 states and 8858 transitions. Second operand 4 states. [2020-10-16 12:02:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:58,112 INFO L93 Difference]: Finished difference Result 2600 states and 8464 transitions. [2020-10-16 12:02:58,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:58,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-16 12:02:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:58,118 INFO L225 Difference]: With dead ends: 2600 [2020-10-16 12:02:58,118 INFO L226 Difference]: Without dead ends: 1936 [2020-10-16 12:02:58,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2020-10-16 12:02:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2020-10-16 12:02:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2020-10-16 12:02:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 6254 transitions. [2020-10-16 12:02:58,260 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 6254 transitions. Word has length 17 [2020-10-16 12:02:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,260 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 6254 transitions. [2020-10-16 12:02:58,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 6254 transitions. [2020-10-16 12:02:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:02:58,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,264 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 12:02:58,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:02:58,265 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2063450738, now seen corresponding path program 1 times [2020-10-16 12:02:58,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064673335] [2020-10-16 12:02:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:58,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064673335] [2020-10-16 12:02:58,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:58,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:58,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683236565] [2020-10-16 12:02:58,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:58,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:58,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:58,335 INFO L87 Difference]: Start difference. First operand 1936 states and 6254 transitions. Second operand 5 states. [2020-10-16 12:02:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:58,383 INFO L93 Difference]: Finished difference Result 1713 states and 5099 transitions. [2020-10-16 12:02:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:58,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-16 12:02:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:58,387 INFO L225 Difference]: With dead ends: 1713 [2020-10-16 12:02:58,387 INFO L226 Difference]: Without dead ends: 1301 [2020-10-16 12:02:58,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-10-16 12:02:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1301. [2020-10-16 12:02:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2020-10-16 12:02:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 3810 transitions. [2020-10-16 12:02:58,412 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 3810 transitions. Word has length 18 [2020-10-16 12:02:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,412 INFO L481 AbstractCegarLoop]: Abstraction has 1301 states and 3810 transitions. [2020-10-16 12:02:58,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 3810 transitions. [2020-10-16 12:02:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:02:58,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,416 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] [2020-10-16 12:02:58,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:02:58,416 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 739572414, now seen corresponding path program 1 times [2020-10-16 12:02:58,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420105955] [2020-10-16 12:02:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:58,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420105955] [2020-10-16 12:02:58,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:58,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:02:58,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734003459] [2020-10-16 12:02:58,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:58,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:58,449 INFO L87 Difference]: Start difference. First operand 1301 states and 3810 transitions. Second operand 3 states. [2020-10-16 12:02:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:58,464 INFO L93 Difference]: Finished difference Result 1897 states and 5389 transitions. [2020-10-16 12:02:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:58,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-16 12:02:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:58,468 INFO L225 Difference]: With dead ends: 1897 [2020-10-16 12:02:58,468 INFO L226 Difference]: Without dead ends: 1315 [2020-10-16 12:02:58,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2020-10-16 12:02:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1295. [2020-10-16 12:02:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2020-10-16 12:02:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 3559 transitions. [2020-10-16 12:02:58,492 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 3559 transitions. Word has length 20 [2020-10-16 12:02:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,493 INFO L481 AbstractCegarLoop]: Abstraction has 1295 states and 3559 transitions. [2020-10-16 12:02:58,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 3559 transitions. [2020-10-16 12:02:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:02:58,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:58,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:02:58,496 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1812037381, now seen corresponding path program 1 times [2020-10-16 12:02:58,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105227776] [2020-10-16 12:02:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:58,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105227776] [2020-10-16 12:02:58,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:58,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:58,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47967269] [2020-10-16 12:02:58,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:58,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:58,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:58,555 INFO L87 Difference]: Start difference. First operand 1295 states and 3559 transitions. Second operand 6 states. [2020-10-16 12:02:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:58,618 INFO L93 Difference]: Finished difference Result 1153 states and 3118 transitions. [2020-10-16 12:02:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:02:58,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-16 12:02:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:58,621 INFO L225 Difference]: With dead ends: 1153 [2020-10-16 12:02:58,621 INFO L226 Difference]: Without dead ends: 949 [2020-10-16 12:02:58,622 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 12:02:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-10-16 12:02:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 865. [2020-10-16 12:02:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2020-10-16 12:02:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2365 transitions. [2020-10-16 12:02:58,638 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 2365 transitions. Word has length 21 [2020-10-16 12:02:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,638 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 2365 transitions. [2020-10-16 12:02:58,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 2365 transitions. [2020-10-16 12:02:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:02:58,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,641 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] [2020-10-16 12:02:58,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:02:58,641 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1840958301, now seen corresponding path program 1 times [2020-10-16 12:02:58,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467509158] [2020-10-16 12:02:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:58,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467509158] [2020-10-16 12:02:58,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:58,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:58,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24075484] [2020-10-16 12:02:58,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:58,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:58,685 INFO L87 Difference]: Start difference. First operand 865 states and 2365 transitions. Second operand 4 states. [2020-10-16 12:02:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:58,704 INFO L93 Difference]: Finished difference Result 1085 states and 2862 transitions. [2020-10-16 12:02:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:58,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-16 12:02:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:58,706 INFO L225 Difference]: With dead ends: 1085 [2020-10-16 12:02:58,706 INFO L226 Difference]: Without dead ends: 616 [2020-10-16 12:02:58,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-10-16 12:02:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2020-10-16 12:02:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2020-10-16 12:02:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1508 transitions. [2020-10-16 12:02:58,717 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1508 transitions. Word has length 24 [2020-10-16 12:02:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,717 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 1508 transitions. [2020-10-16 12:02:58,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1508 transitions. [2020-10-16 12:02:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:02:58,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,719 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] [2020-10-16 12:02:58,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:02:58,719 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1217121977, now seen corresponding path program 1 times [2020-10-16 12:02:58,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117048919] [2020-10-16 12:02:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:58,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117048919] [2020-10-16 12:02:58,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:58,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:02:58,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63212262] [2020-10-16 12:02:58,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:02:58,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:02:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:58,794 INFO L87 Difference]: Start difference. First operand 613 states and 1508 transitions. Second operand 7 states. [2020-10-16 12:02:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:58,885 INFO L93 Difference]: Finished difference Result 585 states and 1454 transitions. [2020-10-16 12:02:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:02:58,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 12:02:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:58,886 INFO L225 Difference]: With dead ends: 585 [2020-10-16 12:02:58,886 INFO L226 Difference]: Without dead ends: 138 [2020-10-16 12:02:58,887 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 12:02:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-16 12:02:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2020-10-16 12:02:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-16 12:02:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 243 transitions. [2020-10-16 12:02:58,890 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 243 transitions. Word has length 24 [2020-10-16 12:02:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:58,890 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 243 transitions. [2020-10-16 12:02:58,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:02:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 243 transitions. [2020-10-16 12:02:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:02:58,891 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:58,891 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] [2020-10-16 12:02:58,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:02:58,891 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 588335306, now seen corresponding path program 1 times [2020-10-16 12:02:58,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:58,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375628103] [2020-10-16 12:02:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:59,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375628103] [2020-10-16 12:02:59,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:59,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:02:59,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64222963] [2020-10-16 12:02:59,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:02:59,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:02:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:59,452 INFO L87 Difference]: Start difference. First operand 114 states and 243 transitions. Second operand 9 states. [2020-10-16 12:02:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:59,585 INFO L93 Difference]: Finished difference Result 152 states and 329 transitions. [2020-10-16 12:02:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:59,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-16 12:02:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:59,587 INFO L225 Difference]: With dead ends: 152 [2020-10-16 12:02:59,587 INFO L226 Difference]: Without dead ends: 92 [2020-10-16 12:02:59,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-16 12:02:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-16 12:02:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-16 12:02:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 195 transitions. [2020-10-16 12:02:59,590 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 195 transitions. Word has length 27 [2020-10-16 12:02:59,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:59,590 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 195 transitions. [2020-10-16 12:02:59,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:02:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 195 transitions. [2020-10-16 12:02:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:02:59,591 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:59,591 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] [2020-10-16 12:02:59,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:02:59,591 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1100305158, now seen corresponding path program 2 times [2020-10-16 12:02:59,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:59,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068106608] [2020-10-16 12:02:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:02:59,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:02:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:02:59,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:02:59,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:02:59,699 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:02:59,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:02:59,700 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:02:59,722 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L850-->L858: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In423898391 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In423898391 256) 0)) (.cse9 (= 0 (mod ~y$w_buff0_used~0_In423898391 256))) (.cse8 (= (mod ~y$r_buff0_thd0~0_In423898391 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff0_used~0_Out423898391 0) .cse1) (and (= ~y$w_buff0_used~0_In423898391 ~y$w_buff0_used~0_Out423898391) .cse2)) (or (and (or (and (= ~y~0_Out423898391 ~y~0_In423898391) .cse3) (and (= ~y~0_Out423898391 ~y$w_buff1~0_In423898391) .cse4 .cse5)) .cse2) (and .cse0 .cse1 (= ~y$w_buff0~0_In423898391 ~y~0_Out423898391))) (or (and .cse4 .cse5 (= ~y$w_buff1_used~0_Out423898391 0)) (and .cse3 (= ~y$w_buff1_used~0_Out423898391 ~y$w_buff1_used~0_In423898391))) (= ~y$r_buff0_thd0~0_Out423898391 ~y$r_buff0_thd0~0_In423898391) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out423898391 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out423898391 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out423898391|) (= (mod ~main$tmp_guard0~0_In423898391 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out423898391|) (= ~y$r_buff1_thd0~0_Out423898391 ~y$r_buff1_thd0~0_In423898391)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In423898391, ~y$w_buff1~0=~y$w_buff1~0_In423898391, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423898391, ~y$w_buff0~0=~y$w_buff0~0_In423898391, ~main$tmp_guard0~0=~main$tmp_guard0~0_In423898391, ~y~0=~y~0_In423898391, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423898391, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423898391} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out423898391, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out423898391|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out423898391|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out423898391|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out423898391|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out423898391|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out423898391|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In423898391, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out423898391|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out423898391, ~y$w_buff1~0=~y$w_buff1~0_In423898391, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out423898391, ~y$w_buff0~0=~y$w_buff0~0_In423898391, ~y~0=~y~0_Out423898391, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out423898391, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out423898391} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:02:59,729 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:59,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:59,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:02:59 BasicIcfg [2020-10-16 12:02:59,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:02:59,818 INFO L168 Benchmark]: Toolchain (without parser) took 19636.46 ms. Allocated memory was 146.8 MB in the beginning and 475.5 MB in the end (delta: 328.7 MB). Free memory was 102.1 MB in the beginning and 35.3 MB in the end (delta: 66.8 MB). Peak memory consumption was 395.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:59,819 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:02:59,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.25 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 159.9 MB in the end (delta: -58.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:59,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.88 ms. Allocated memory is still 205.0 MB. Free memory was 159.9 MB in the beginning and 157.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:59,820 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 205.0 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:59,821 INFO L168 Benchmark]: RCFGBuilder took 2177.75 ms. Allocated memory was 205.0 MB in the beginning and 246.9 MB in the end (delta: 41.9 MB). Free memory was 154.5 MB in the beginning and 163.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:59,821 INFO L168 Benchmark]: TraceAbstraction took 16604.54 ms. Allocated memory was 246.9 MB in the beginning and 475.5 MB in the end (delta: 228.6 MB). Free memory was 161.7 MB in the beginning and 35.3 MB in the end (delta: 126.5 MB). Peak memory consumption was 355.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:59,824 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.18 ms. Allocated memory is still 146.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.25 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 159.9 MB in the end (delta: -58.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.88 ms. Allocated memory is still 205.0 MB. Free memory was 159.9 MB in the beginning and 157.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 205.0 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2177.75 ms. Allocated memory was 205.0 MB in the beginning and 246.9 MB in the end (delta: 41.9 MB). Free memory was 154.5 MB in the beginning and 163.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16604.54 ms. Allocated memory was 246.9 MB in the beginning and 475.5 MB in the end (delta: 228.6 MB). Free memory was 161.7 MB in the beginning and 35.3 MB in the end (delta: 126.5 MB). Peak memory consumption was 355.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1397 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 116 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 124 PlacesBefore, 46 PlacesAfterwards, 113 TransitionsBefore, 33 TransitionsAfterwards, 2670 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 7908 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_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff0_thd4; [L723] 0 _Bool y$r_buff1_thd0; [L724] 0 _Bool y$r_buff1_thd1; [L725] 0 _Bool y$r_buff1_thd2; [L726] 0 _Bool y$r_buff1_thd3; [L727] 0 _Bool y$r_buff1_thd4; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L840] 0 pthread_t t1081; [L841] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] 0 pthread_t t1082; [L843] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t1083; [L845] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t1084; [L847] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L786] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 4 z = 1 [L809] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L822] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L825] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 4 return 0; [L741] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L849] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L860] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L861] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L862] 0 y$flush_delayed = weak$$choice2 [L863] 0 y$mem_tmp = y [L864] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L864] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L865] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L865] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L866] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L867] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L868] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L869] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L872] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L872] 0 y = y$flush_delayed ? y$mem_tmp : y [L873] 0 y$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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 702 SDtfs, 1002 SDslu, 1133 SDs, 0 SdLazy, 501 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1803 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 62852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...