/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/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:04:44,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:04:44,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:04:44,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:04:44,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:04:44,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:04:44,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:04:44,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:04:44,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:04:44,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:04:44,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:04:44,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:04:44,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:04:44,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:04:44,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:04:44,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:04:44,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:04:44,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:04:44,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:04:44,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:04:44,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:04:44,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:04:44,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:04:44,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:04:44,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:04:44,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:04:44,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:04:44,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:04:44,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:04:44,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:04:44,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:04:44,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:04:44,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:04:44,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:04:44,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:04:44,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:04:44,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:04:44,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:04:44,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:04:44,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:04:44,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:04:44,380 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:04:44,422 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:04:44,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:04:44,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:04:44,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:04:44,424 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:04:44,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:04:44,425 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:04:44,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:04:44,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:04:44,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:04:44,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:04:44,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:04:44,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:04:44,427 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:04:44,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:04:44,428 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:04:44,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:04:44,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:04:44,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:04:44,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:04:44,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:04:44,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:44,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:04:44,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:04:44,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:04:44,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:04:44,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:04:44,430 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:04:44,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:04:44,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:04:44,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:04:44,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:04:44,723 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:04:44,726 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:04:44,726 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-16 12:04:44,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc9b63b43/5214f2f81297464b850a1a119656a6fd/FLAG54d0e5ad0 [2020-10-16 12:04:45,388 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:04:45,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-16 12:04:45,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc9b63b43/5214f2f81297464b850a1a119656a6fd/FLAG54d0e5ad0 [2020-10-16 12:04:45,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bc9b63b43/5214f2f81297464b850a1a119656a6fd [2020-10-16 12:04:45,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:04:45,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:04:45,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:45,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:04:45,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:04:45,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:45" (1/1) ... [2020-10-16 12:04:45,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4874472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:45, skipping insertion in model container [2020-10-16 12:04:45,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:45" (1/1) ... [2020-10-16 12:04:45,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:04:45,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:04:46,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:46,241 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:04:46,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:46,381 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:04:46,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46 WrapperNode [2020-10-16 12:04:46,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:46,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:46,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:04:46,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:04:46,393 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:04:46" (1/1) ... [2020-10-16 12:04:46,413 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:04:46" (1/1) ... [2020-10-16 12:04:46,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:46,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:04:46,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:04:46,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:04:46,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (1/1) ... [2020-10-16 12:04:46,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:04:46,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:04:46,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:04:46,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:04:46,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (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:04:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:04:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:04:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:04:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:04:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:04:46,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:04:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:04:46,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:04:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:04:46,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:04:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:04:46,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:04:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:04:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:04:46,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:04:46,577 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:04:48,553 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:04:48,554 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:04:48,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:48 BoogieIcfgContainer [2020-10-16 12:04:48,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:04:48,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:04:48,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:04:48,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:04:48,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:45" (1/3) ... [2020-10-16 12:04:48,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de59e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:48, skipping insertion in model container [2020-10-16 12:04:48,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:46" (2/3) ... [2020-10-16 12:04:48,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de59e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:48, skipping insertion in model container [2020-10-16 12:04:48,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:48" (3/3) ... [2020-10-16 12:04:48,569 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2020-10-16 12:04:48,579 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:04:48,579 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:04:48,586 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:04:48,587 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:04:48,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,618 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,618 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,619 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,619 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,621 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,621 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,625 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,632 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,638 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,646 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,647 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:48,653 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:04:48,667 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:04:48,691 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:04:48,692 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:04:48,692 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:04:48,692 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:04:48,692 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:04:48,692 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:04:48,692 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:04:48,693 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:04:48,713 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:04:48,715 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-16 12:04:48,718 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-16 12:04:48,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-16 12:04:48,772 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-16 12:04:48,772 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:04:48,778 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 12:04:48,782 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 12:04:50,406 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 12:04:50,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 12:04:50,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:50,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:04:50,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:51,494 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 12:04:52,007 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:04:52,915 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 12:04:53,268 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 12:04:53,653 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:04:54,036 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:04:54,970 WARN L193 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 12:04:55,246 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:04:56,242 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 134 [2020-10-16 12:04:56,568 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 12:04:56,852 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 12:04:56,976 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 12:04:56,985 INFO L132 LiptonReduction]: Checked pairs total: 6503 [2020-10-16 12:04:56,985 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 12:04:56,995 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-16 12:04:57,183 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-16 12:04:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-16 12:04:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:04:57,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:57,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:57,196 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1341205228, now seen corresponding path program 1 times [2020-10-16 12:04:57,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:57,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265951151] [2020-10-16 12:04:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:57,523 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:04:57,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265951151] [2020-10-16 12:04:57,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:57,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:57,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558106431] [2020-10-16 12:04:57,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:57,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:57,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:57,592 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-16 12:04:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:57,703 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-16 12:04:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:57,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:04:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:57,741 INFO L225 Difference]: With dead ends: 2202 [2020-10-16 12:04:57,741 INFO L226 Difference]: Without dead ends: 1802 [2020-10-16 12:04:57,743 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:04:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-16 12:04:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-16 12:04:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-16 12:04:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-16 12:04:57,937 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-16 12:04:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:57,939 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-16 12:04:57,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-16 12:04:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:04:57,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:57,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:57,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:04:57,945 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:57,945 INFO L82 PathProgramCache]: Analyzing trace with hash 408129342, now seen corresponding path program 1 times [2020-10-16 12:04:57,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:57,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392275637] [2020-10-16 12:04:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:58,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392275637] [2020-10-16 12:04:58,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:58,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:58,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305804554] [2020-10-16 12:04:58,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:58,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:58,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:58,116 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-16 12:04:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:58,162 INFO L93 Difference]: Finished difference Result 1792 states and 6736 transitions. [2020-10-16 12:04:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:58,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:04:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:58,180 INFO L225 Difference]: With dead ends: 1792 [2020-10-16 12:04:58,181 INFO L226 Difference]: Without dead ends: 1792 [2020-10-16 12:04:58,182 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:04:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-10-16 12:04:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2020-10-16 12:04:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-10-16 12:04:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6736 transitions. [2020-10-16 12:04:58,256 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6736 transitions. Word has length 11 [2020-10-16 12:04:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:58,257 INFO L481 AbstractCegarLoop]: Abstraction has 1792 states and 6736 transitions. [2020-10-16 12:04:58,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6736 transitions. [2020-10-16 12:04:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:04:58,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:58,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:58,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:04:58,260 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -671107810, now seen corresponding path program 1 times [2020-10-16 12:04:58,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:58,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029489525] [2020-10-16 12:04:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:58,361 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:04:58,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029489525] [2020-10-16 12:04:58,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:58,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:04:58,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686297732] [2020-10-16 12:04:58,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:58,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:58,364 INFO L87 Difference]: Start difference. First operand 1792 states and 6736 transitions. Second operand 4 states. [2020-10-16 12:04:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:58,448 INFO L93 Difference]: Finished difference Result 1764 states and 6612 transitions. [2020-10-16 12:04:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:58,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:04:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:58,466 INFO L225 Difference]: With dead ends: 1764 [2020-10-16 12:04:58,467 INFO L226 Difference]: Without dead ends: 1764 [2020-10-16 12:04:58,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2020-10-16 12:04:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2020-10-16 12:04:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2020-10-16 12:04:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 6612 transitions. [2020-10-16 12:04:58,542 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 6612 transitions. Word has length 12 [2020-10-16 12:04:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:58,543 INFO L481 AbstractCegarLoop]: Abstraction has 1764 states and 6612 transitions. [2020-10-16 12:04:58,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 6612 transitions. [2020-10-16 12:04:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:04:58,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:58,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:58,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:04:58,546 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:58,547 INFO L82 PathProgramCache]: Analyzing trace with hash -234878197, now seen corresponding path program 1 times [2020-10-16 12:04:58,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:58,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954344880] [2020-10-16 12:04:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:58,612 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:04:58,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954344880] [2020-10-16 12:04:58,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:58,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:58,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162600444] [2020-10-16 12:04:58,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:58,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:58,615 INFO L87 Difference]: Start difference. First operand 1764 states and 6612 transitions. Second operand 3 states. [2020-10-16 12:04:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:58,649 INFO L93 Difference]: Finished difference Result 1724 states and 6430 transitions. [2020-10-16 12:04:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:58,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:04:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:58,670 INFO L225 Difference]: With dead ends: 1724 [2020-10-16 12:04:58,671 INFO L226 Difference]: Without dead ends: 1724 [2020-10-16 12:04:58,671 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:04:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2020-10-16 12:04:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2020-10-16 12:04:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-10-16 12:04:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 6430 transitions. [2020-10-16 12:04:58,744 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 6430 transitions. Word has length 12 [2020-10-16 12:04:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:58,744 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 6430 transitions. [2020-10-16 12:04:58,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 6430 transitions. [2020-10-16 12:04:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:04:58,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:58,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:58,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:04:58,747 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 668508459, now seen corresponding path program 1 times [2020-10-16 12:04:58,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:58,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200670014] [2020-10-16 12:04:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:58,852 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:04:58,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200670014] [2020-10-16 12:04:58,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:58,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:58,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961000850] [2020-10-16 12:04:58,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:58,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:58,855 INFO L87 Difference]: Start difference. First operand 1724 states and 6430 transitions. Second operand 5 states. [2020-10-16 12:04:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:58,938 INFO L93 Difference]: Finished difference Result 1668 states and 6182 transitions. [2020-10-16 12:04:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:58,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:04:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:58,954 INFO L225 Difference]: With dead ends: 1668 [2020-10-16 12:04:58,954 INFO L226 Difference]: Without dead ends: 1668 [2020-10-16 12:04:58,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:58,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-10-16 12:04:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-10-16 12:04:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-10-16 12:04:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 6182 transitions. [2020-10-16 12:04:59,022 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 6182 transitions. Word has length 13 [2020-10-16 12:04:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:59,024 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 6182 transitions. [2020-10-16 12:04:59,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 6182 transitions. [2020-10-16 12:04:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:04:59,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:59,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:59,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:04:59,027 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -689526251, now seen corresponding path program 1 times [2020-10-16 12:04:59,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:59,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829514805] [2020-10-16 12:04:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:59,098 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:04:59,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829514805] [2020-10-16 12:04:59,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:59,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:04:59,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968518387] [2020-10-16 12:04:59,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:59,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:59,101 INFO L87 Difference]: Start difference. First operand 1668 states and 6182 transitions. Second operand 4 states. [2020-10-16 12:04:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:59,217 INFO L93 Difference]: Finished difference Result 1684 states and 6238 transitions. [2020-10-16 12:04:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:59,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:04:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:59,233 INFO L225 Difference]: With dead ends: 1684 [2020-10-16 12:04:59,234 INFO L226 Difference]: Without dead ends: 1684 [2020-10-16 12:04:59,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2020-10-16 12:04:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2020-10-16 12:04:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2020-10-16 12:04:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 6238 transitions. [2020-10-16 12:04:59,292 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 6238 transitions. Word has length 14 [2020-10-16 12:04:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:59,293 INFO L481 AbstractCegarLoop]: Abstraction has 1684 states and 6238 transitions. [2020-10-16 12:04:59,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 6238 transitions. [2020-10-16 12:04:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:04:59,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:59,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:59,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:04:59,296 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -690440441, now seen corresponding path program 2 times [2020-10-16 12:04:59,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:59,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479158332] [2020-10-16 12:04:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:59,418 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:04:59,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479158332] [2020-10-16 12:04:59,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:59,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:59,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722181182] [2020-10-16 12:04:59,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:59,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:59,421 INFO L87 Difference]: Start difference. First operand 1684 states and 6238 transitions. Second operand 5 states. [2020-10-16 12:04:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:59,511 INFO L93 Difference]: Finished difference Result 1642 states and 6066 transitions. [2020-10-16 12:04:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:59,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:04:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:59,527 INFO L225 Difference]: With dead ends: 1642 [2020-10-16 12:04:59,527 INFO L226 Difference]: Without dead ends: 1642 [2020-10-16 12:04:59,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-16 12:04:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1626. [2020-10-16 12:04:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-16 12:04:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 6010 transitions. [2020-10-16 12:04:59,582 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 6010 transitions. Word has length 14 [2020-10-16 12:04:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:59,582 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 6010 transitions. [2020-10-16 12:04:59,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 6010 transitions. [2020-10-16 12:04:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:04:59,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:59,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:59,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:04:59,586 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1890097590, now seen corresponding path program 1 times [2020-10-16 12:04:59,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:59,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103998068] [2020-10-16 12:04:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:59,672 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:04:59,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103998068] [2020-10-16 12:04:59,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:59,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:59,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622589963] [2020-10-16 12:04:59,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:59,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:59,674 INFO L87 Difference]: Start difference. First operand 1626 states and 6010 transitions. Second operand 4 states. [2020-10-16 12:04:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:59,733 INFO L93 Difference]: Finished difference Result 1682 states and 5674 transitions. [2020-10-16 12:04:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:59,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 12:04:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:59,758 INFO L225 Difference]: With dead ends: 1682 [2020-10-16 12:04:59,758 INFO L226 Difference]: Without dead ends: 1282 [2020-10-16 12:04:59,759 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:04:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-10-16 12:04:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-10-16 12:04:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-10-16 12:04:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 4290 transitions. [2020-10-16 12:04:59,800 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 4290 transitions. Word has length 15 [2020-10-16 12:04:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:59,800 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 4290 transitions. [2020-10-16 12:04:59,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 4290 transitions. [2020-10-16 12:04:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:04:59,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:59,806 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:04:59,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:04:59,806 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1535573628, now seen corresponding path program 1 times [2020-10-16 12:04:59,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:59,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145622571] [2020-10-16 12:04:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:59,936 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:04:59,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145622571] [2020-10-16 12:04:59,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:59,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:59,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051155740] [2020-10-16 12:04:59,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:59,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:59,939 INFO L87 Difference]: Start difference. First operand 1282 states and 4290 transitions. Second operand 5 states. [2020-10-16 12:04:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:59,998 INFO L93 Difference]: Finished difference Result 1105 states and 3390 transitions. [2020-10-16 12:04:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:04:59,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:04:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:00,002 INFO L225 Difference]: With dead ends: 1105 [2020-10-16 12:05:00,003 INFO L226 Difference]: Without dead ends: 849 [2020-10-16 12:05:00,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-10-16 12:05:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-10-16 12:05:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-16 12:05:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2558 transitions. [2020-10-16 12:05:00,027 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2558 transitions. Word has length 16 [2020-10-16 12:05:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:00,028 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2558 transitions. [2020-10-16 12:05:00,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2558 transitions. [2020-10-16 12:05:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:05:00,030 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:00,030 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:05:00,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:05:00,031 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1327185945, now seen corresponding path program 1 times [2020-10-16 12:05:00,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:00,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858775245] [2020-10-16 12:05:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:00,083 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:05:00,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858775245] [2020-10-16 12:05:00,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:00,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:00,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385434363] [2020-10-16 12:05:00,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:00,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:00,087 INFO L87 Difference]: Start difference. First operand 849 states and 2558 transitions. Second operand 3 states. [2020-10-16 12:05:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:00,118 INFO L93 Difference]: Finished difference Result 1190 states and 3477 transitions. [2020-10-16 12:05:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:00,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-16 12:05:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:00,122 INFO L225 Difference]: With dead ends: 1190 [2020-10-16 12:05:00,122 INFO L226 Difference]: Without dead ends: 860 [2020-10-16 12:05:00,123 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:05:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-10-16 12:05:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 840. [2020-10-16 12:05:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2020-10-16 12:05:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2399 transitions. [2020-10-16 12:05:00,146 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2399 transitions. Word has length 18 [2020-10-16 12:05:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:00,148 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 2399 transitions. [2020-10-16 12:05:00,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2399 transitions. [2020-10-16 12:05:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:05:00,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:00,151 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:05:00,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:05:00,151 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 738469067, now seen corresponding path program 1 times [2020-10-16 12:05:00,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:00,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587228079] [2020-10-16 12:05:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:00,272 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:05:00,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587228079] [2020-10-16 12:05:00,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:00,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:00,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838135283] [2020-10-16 12:05:00,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:00,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:00,275 INFO L87 Difference]: Start difference. First operand 840 states and 2399 transitions. Second operand 6 states. [2020-10-16 12:05:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:00,344 INFO L93 Difference]: Finished difference Result 733 states and 2056 transitions. [2020-10-16 12:05:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:05:00,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 12:05:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:00,349 INFO L225 Difference]: With dead ends: 733 [2020-10-16 12:05:00,350 INFO L226 Difference]: Without dead ends: 645 [2020-10-16 12:05:00,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-10-16 12:05:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2020-10-16 12:05:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-10-16 12:05:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1834 transitions. [2020-10-16 12:05:00,369 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1834 transitions. Word has length 18 [2020-10-16 12:05:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:00,370 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1834 transitions. [2020-10-16 12:05:00,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1834 transitions. [2020-10-16 12:05:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:05:00,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:00,372 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:05:00,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:05:00,373 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1256513490, now seen corresponding path program 1 times [2020-10-16 12:05:00,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:00,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104766892] [2020-10-16 12:05:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:00,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104766892] [2020-10-16 12:05:00,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:00,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:00,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860555791] [2020-10-16 12:05:00,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:00,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:00,507 INFO L87 Difference]: Start difference. First operand 645 states and 1834 transitions. Second operand 6 states. [2020-10-16 12:05:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:00,613 INFO L93 Difference]: Finished difference Result 915 states and 2538 transitions. [2020-10-16 12:05:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:00,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-16 12:05:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:00,617 INFO L225 Difference]: With dead ends: 915 [2020-10-16 12:05:00,617 INFO L226 Difference]: Without dead ends: 645 [2020-10-16 12:05:00,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-10-16 12:05:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 641. [2020-10-16 12:05:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-16 12:05:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1739 transitions. [2020-10-16 12:05:00,635 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1739 transitions. Word has length 21 [2020-10-16 12:05:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:00,635 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 1739 transitions. [2020-10-16 12:05:00,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1739 transitions. [2020-10-16 12:05:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:05:00,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:00,690 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:05:00,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:05:00,690 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1670045084, now seen corresponding path program 2 times [2020-10-16 12:05:00,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:00,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461974843] [2020-10-16 12:05:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:00,857 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:05:00,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461974843] [2020-10-16 12:05:00,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:00,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:05:00,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525945800] [2020-10-16 12:05:00,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:00,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:00,859 INFO L87 Difference]: Start difference. First operand 641 states and 1739 transitions. Second operand 7 states. [2020-10-16 12:05:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:00,938 INFO L93 Difference]: Finished difference Result 615 states and 1686 transitions. [2020-10-16 12:05:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:05:00,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:05:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:00,940 INFO L225 Difference]: With dead ends: 615 [2020-10-16 12:05:00,940 INFO L226 Difference]: Without dead ends: 224 [2020-10-16 12:05:00,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-16 12:05:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-10-16 12:05:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-16 12:05:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 586 transitions. [2020-10-16 12:05:00,947 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 586 transitions. Word has length 21 [2020-10-16 12:05:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:00,948 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 586 transitions. [2020-10-16 12:05:00,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 586 transitions. [2020-10-16 12:05:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 12:05:00,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:00,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:00,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:05:00,950 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1669800279, now seen corresponding path program 1 times [2020-10-16 12:05:00,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:00,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465120386] [2020-10-16 12:05:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:01,267 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:05:01,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465120386] [2020-10-16 12:05:01,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:01,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:05:01,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732829109] [2020-10-16 12:05:01,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:05:01,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:01,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:05:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:01,270 INFO L87 Difference]: Start difference. First operand 224 states and 586 transitions. Second operand 8 states. [2020-10-16 12:05:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:01,489 INFO L93 Difference]: Finished difference Result 369 states and 929 transitions. [2020-10-16 12:05:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:05:01,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-10-16 12:05:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:01,492 INFO L225 Difference]: With dead ends: 369 [2020-10-16 12:05:01,492 INFO L226 Difference]: Without dead ends: 267 [2020-10-16 12:05:01,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:05:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-10-16 12:05:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 184. [2020-10-16 12:05:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-16 12:05:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 458 transitions. [2020-10-16 12:05:01,501 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 458 transitions. Word has length 25 [2020-10-16 12:05:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:01,501 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 458 transitions. [2020-10-16 12:05:01,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:05:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 458 transitions. [2020-10-16 12:05:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 12:05:01,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:01,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:01,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:05:01,504 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:01,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:01,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2056310337, now seen corresponding path program 2 times [2020-10-16 12:05:01,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:01,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600679246] [2020-10-16 12:05:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:01,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:01,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:01,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:05:01,704 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:05:01,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:05:01,705 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:05:01,720 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L2-->L843: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In-1419920612 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-1419920612 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-1419920612 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-1419920612 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In-1419920612 ~z$r_buff1_thd0~0_Out-1419920612) (= ~z$r_buff0_thd0~0_Out-1419920612 ~z$r_buff0_thd0~0_In-1419920612) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1419920612 0)) (or (and (= ~z$w_buff0_used~0_Out-1419920612 ~z$w_buff0_used~0_In-1419920612) .cse0) (and .cse1 .cse2 (= ~z$w_buff0_used~0_Out-1419920612 0))) (or (and (= ~z$w_buff1_used~0_In-1419920612 ~z$w_buff1_used~0_Out-1419920612) .cse3) (and (= ~z$w_buff1_used~0_Out-1419920612 0) .cse4 .cse5)) (or (and (or (and (= ~z~0_Out-1419920612 ~z~0_In-1419920612) .cse3) (and .cse4 .cse5 (= ~z~0_Out-1419920612 ~z$w_buff1~0_In-1419920612))) .cse0) (and .cse1 (= ~z~0_Out-1419920612 ~z$w_buff0~0_In-1419920612) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1419920612 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1419920612|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1419920612|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1419920612, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1419920612, ~z$w_buff0~0=~z$w_buff0~0_In-1419920612, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1419920612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1419920612, ~z$w_buff1~0=~z$w_buff1~0_In-1419920612, ~z~0=~z~0_In-1419920612} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1419920612, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1419920612|, ~z$w_buff0~0=~z$w_buff0~0_In-1419920612, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1419920612|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1419920612, ~z$w_buff1~0=~z$w_buff1~0_In-1419920612, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1419920612|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1419920612|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1419920612|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1419920612|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1419920612|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1419920612, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1419920612, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1419920612, ~z~0=~z~0_Out-1419920612} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:05:01,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:05:01,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,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:05:01,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,742 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:05:01,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,742 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:05:01,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,742 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:05:01,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,747 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:05:01,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,747 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:05:01,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,748 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:05:01,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,748 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:05:01,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,748 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:05:01,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,749 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:05:01,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,749 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:05:01,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:01,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:05:01 BasicIcfg [2020-10-16 12:05:01,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:05:01,842 INFO L168 Benchmark]: Toolchain (without parser) took 16193.58 ms. Allocated memory was 139.5 MB in the beginning and 430.4 MB in the end (delta: 291.0 MB). Free memory was 99.3 MB in the beginning and 239.3 MB in the end (delta: -140.0 MB). Peak memory consumption was 151.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,842 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 119.3 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.90 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 154.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.41 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,845 INFO L168 Benchmark]: Boogie Preprocessor took 40.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 148.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,846 INFO L168 Benchmark]: RCFGBuilder took 2063.28 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 148.8 MB in the beginning and 189.3 MB in the end (delta: -40.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,847 INFO L168 Benchmark]: TraceAbstraction took 13279.56 ms. Allocated memory was 248.5 MB in the beginning and 430.4 MB in the end (delta: 181.9 MB). Free memory was 189.3 MB in the beginning and 239.3 MB in the end (delta: -50.0 MB). Peak memory consumption was 132.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:01,851 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.40 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 119.3 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.90 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 154.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.41 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 148.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2063.28 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 148.8 MB in the beginning and 189.3 MB in the end (delta: -40.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13279.56 ms. Allocated memory was 248.5 MB in the beginning and 430.4 MB in the end (delta: 181.9 MB). Free memory was 189.3 MB in the beginning and 239.3 MB in the end (delta: -50.0 MB). Peak memory consumption was 132.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1217 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 107 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.2s, 119 PlacesBefore, 44 PlacesAfterwards, 108 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 6503 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1477; [L826] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1478; [L828] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1479; [L830] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1480; [L832] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 434 SDtfs, 493 SDslu, 748 SDs, 0 SdLazy, 333 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 123 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 23105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...