/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/mix030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:01:14,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:01:14,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:01:14,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:01:14,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:01:14,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:01:14,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:01:14,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:01:14,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:01:14,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:01:14,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:01:14,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:01:14,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:01:14,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:01:14,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:01:14,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:01:14,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:01:14,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:01:14,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:01:14,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:01:14,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:01:14,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:01:14,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:01:14,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:01:14,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:01:14,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:01:14,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:01:14,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:01:14,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:01:14,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:01:14,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:01:14,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:01:14,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:01:14,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:01:14,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:01:14,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:01:14,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:01:14,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:01:14,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:01:14,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:01:14,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:01:14,440 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:01:14,485 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:01:14,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:01:14,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:01:14,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:01:14,488 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:01:14,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:01:14,489 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:01:14,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:01:14,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:01:14,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:01:14,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:01:14,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:01:14,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:01:14,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:01:14,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:01:14,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:01:14,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:01:14,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:01:14,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:01:14,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:01:14,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:01:14,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:01:14,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:01:14,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:01:14,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:01:14,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:01:14,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:01:14,494 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:01:14,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:01:14,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:01:14,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:01:14,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:01:14,838 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:01:14,838 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:01:14,839 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i [2020-10-16 12:01:14,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/81dccf314/11c631dfa4c94cd9a54f3e040d321067/FLAGf82be018a [2020-10-16 12:01:15,389 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:01:15,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i [2020-10-16 12:01:15,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/81dccf314/11c631dfa4c94cd9a54f3e040d321067/FLAGf82be018a [2020-10-16 12:01:15,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/81dccf314/11c631dfa4c94cd9a54f3e040d321067 [2020-10-16 12:01:15,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:01:15,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:01:15,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:01:15,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:01:15,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:01:15,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:15" (1/1) ... [2020-10-16 12:01:15,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b60800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:15, skipping insertion in model container [2020-10-16 12:01:15,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:15" (1/1) ... [2020-10-16 12:01:15,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:01:15,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:01:16,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:01:16,209 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:01:16,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:01:16,370 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:01:16,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16 WrapperNode [2020-10-16 12:01:16,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:01:16,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:01:16,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:01:16,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:01:16,381 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:01:16" (1/1) ... [2020-10-16 12:01:16,402 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:01:16" (1/1) ... [2020-10-16 12:01:16,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:01:16,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:01:16,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:01:16,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:01:16,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (1/1) ... [2020-10-16 12:01:16,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:01:16,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:01:16,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:01:16,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:01:16,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (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:01:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:01:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:01:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:01:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:01:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:01:16,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:01:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:01:16,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:01:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:01:16,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:01:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:01:16,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:01:16,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:01:16,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:01:16,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:01:16,562 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:01:18,783 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:01:18,784 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:01:18,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:18 BoogieIcfgContainer [2020-10-16 12:01:18,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:01:18,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:01:18,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:01:18,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:01:18,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:01:15" (1/3) ... [2020-10-16 12:01:18,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fe5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:18, skipping insertion in model container [2020-10-16 12:01:18,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:16" (2/3) ... [2020-10-16 12:01:18,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fe5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:18, skipping insertion in model container [2020-10-16 12:01:18,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:18" (3/3) ... [2020-10-16 12:01:18,796 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_power.opt.i [2020-10-16 12:01:18,808 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:01:18,809 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:01:18,817 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:01:18,818 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:01:18,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,851 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,851 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,857 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,857 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,860 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,861 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,867 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,869 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,869 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,874 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,874 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,876 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,876 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,881 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,881 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:01:18,883 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:01:18,898 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:01:18,920 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:01:18,921 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:01:18,921 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:01:18,921 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:01:18,921 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:01:18,921 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:01:18,921 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:01:18,922 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:01:18,936 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:01:18,937 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-16 12:01:18,939 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-16 12:01:18,941 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 12:01:18,992 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 12:01:18,992 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:01:18,998 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:01:19,002 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-16 12:01:20,365 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:01:20,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:01:20,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:01:20,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:01:20,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:01:21,313 WARN L193 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 12:01:21,864 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:01:23,730 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-16 12:01:24,057 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:01:24,542 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 12:01:24,693 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 12:01:25,447 WARN L193 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2020-10-16 12:01:25,760 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:01:25,793 INFO L132 LiptonReduction]: Checked pairs total: 7068 [2020-10-16 12:01:25,794 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 12:01:25,803 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-16 12:01:26,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-16 12:01:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-16 12:01:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:01:26,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:26,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:26,069 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1030616479, now seen corresponding path program 1 times [2020-10-16 12:01:26,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:26,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733453317] [2020-10-16 12:01:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:26,448 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:01:26,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733453317] [2020-10-16 12:01:26,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:26,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:26,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303087533] [2020-10-16 12:01:26,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:26,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:26,474 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-16 12:01:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:26,612 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-16 12:01:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:26,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:01:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:26,658 INFO L225 Difference]: With dead ends: 3250 [2020-10-16 12:01:26,658 INFO L226 Difference]: Without dead ends: 2650 [2020-10-16 12:01:26,660 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:01:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-16 12:01:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-16 12:01:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-16 12:01:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-16 12:01:26,851 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-16 12:01:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:26,852 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-16 12:01:26,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-16 12:01:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:01:26,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:26,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:26,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:01:26,856 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1072761819, now seen corresponding path program 1 times [2020-10-16 12:01:26,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:26,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504198358] [2020-10-16 12:01:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:26,945 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:01:26,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504198358] [2020-10-16 12:01:26,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:26,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:26,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735388774] [2020-10-16 12:01:26,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:26,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:26,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:26,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:26,949 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-16 12:01:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:26,987 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-10-16 12:01:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:26,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:01:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,011 INFO L225 Difference]: With dead ends: 2610 [2020-10-16 12:01:27,012 INFO L226 Difference]: Without dead ends: 2610 [2020-10-16 12:01:27,013 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:01:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-16 12:01:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-16 12:01:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-16 12:01:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-10-16 12:01:27,121 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-10-16 12:01:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,121 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-10-16 12:01:27,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-10-16 12:01:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:01:27,124 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:01:27,125 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1104121036, now seen corresponding path program 1 times [2020-10-16 12:01:27,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939427455] [2020-10-16 12:01:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,199 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:01:27,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939427455] [2020-10-16 12:01:27,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:27,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367920695] [2020-10-16 12:01:27,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:27,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:27,202 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states. [2020-10-16 12:01:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,263 INFO L93 Difference]: Finished difference Result 2600 states and 9998 transitions. [2020-10-16 12:01:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:27,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:01:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,293 INFO L225 Difference]: With dead ends: 2600 [2020-10-16 12:01:27,294 INFO L226 Difference]: Without dead ends: 2600 [2020-10-16 12:01:27,294 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:01:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2020-10-16 12:01:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2600. [2020-10-16 12:01:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2020-10-16 12:01:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 9998 transitions. [2020-10-16 12:01:27,394 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 9998 transitions. Word has length 12 [2020-10-16 12:01:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,394 INFO L481 AbstractCegarLoop]: Abstraction has 2600 states and 9998 transitions. [2020-10-16 12:01:27,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 9998 transitions. [2020-10-16 12:01:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:01:27,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:01:27,398 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1604945034, now seen corresponding path program 1 times [2020-10-16 12:01:27,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501060678] [2020-10-16 12:01:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,459 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:01:27,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501060678] [2020-10-16 12:01:27,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:27,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222590675] [2020-10-16 12:01:27,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:27,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:27,462 INFO L87 Difference]: Start difference. First operand 2600 states and 9998 transitions. Second operand 3 states. [2020-10-16 12:01:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,516 INFO L93 Difference]: Finished difference Result 2582 states and 9917 transitions. [2020-10-16 12:01:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:27,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:01:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,604 INFO L225 Difference]: With dead ends: 2582 [2020-10-16 12:01:27,604 INFO L226 Difference]: Without dead ends: 2582 [2020-10-16 12:01:27,604 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:01:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2020-10-16 12:01:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2582. [2020-10-16 12:01:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2020-10-16 12:01:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9917 transitions. [2020-10-16 12:01:27,698 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 9917 transitions. Word has length 13 [2020-10-16 12:01:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,699 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 9917 transitions. [2020-10-16 12:01:27,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 9917 transitions. [2020-10-16 12:01:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:01:27,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:01:27,702 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1798747636, now seen corresponding path program 1 times [2020-10-16 12:01:27,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621595500] [2020-10-16 12:01:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,749 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:01:27,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621595500] [2020-10-16 12:01:27,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:27,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644897713] [2020-10-16 12:01:27,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:27,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:27,752 INFO L87 Difference]: Start difference. First operand 2582 states and 9917 transitions. Second operand 3 states. [2020-10-16 12:01:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,785 INFO L93 Difference]: Finished difference Result 2536 states and 9707 transitions. [2020-10-16 12:01:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:27,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:01:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,808 INFO L225 Difference]: With dead ends: 2536 [2020-10-16 12:01:27,808 INFO L226 Difference]: Without dead ends: 2536 [2020-10-16 12:01:27,808 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:01:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2020-10-16 12:01:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2020-10-16 12:01:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2020-10-16 12:01:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 9707 transitions. [2020-10-16 12:01:27,887 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 9707 transitions. Word has length 13 [2020-10-16 12:01:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:27,888 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 9707 transitions. [2020-10-16 12:01:27,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 9707 transitions. [2020-10-16 12:01:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:01:27,891 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:27,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:27,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:01:27,891 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash 841894414, now seen corresponding path program 1 times [2020-10-16 12:01:27,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:27,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238490061] [2020-10-16 12:01:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:27,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:01:27,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238490061] [2020-10-16 12:01:27,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:27,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:01:27,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923361465] [2020-10-16 12:01:27,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:27,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:27,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:27,938 INFO L87 Difference]: Start difference. First operand 2536 states and 9707 transitions. Second operand 3 states. [2020-10-16 12:01:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:27,962 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-10-16 12:01:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:27,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-16 12:01:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:27,974 INFO L225 Difference]: With dead ends: 2410 [2020-10-16 12:01:27,975 INFO L226 Difference]: Without dead ends: 2410 [2020-10-16 12:01:27,975 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:01:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-16 12:01:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-16 12:01:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:01:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-10-16 12:01:28,052 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 14 [2020-10-16 12:01:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,053 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-10-16 12:01:28,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-10-16 12:01:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:01:28,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:28,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:01:28,056 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1786313371, now seen corresponding path program 1 times [2020-10-16 12:01:28,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053118656] [2020-10-16 12:01:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:28,190 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:01:28,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053118656] [2020-10-16 12:01:28,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:28,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:01:28,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925120519] [2020-10-16 12:01:28,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:28,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:28,198 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 4 states. [2020-10-16 12:01:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,276 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-16 12:01:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:28,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:01:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,290 INFO L225 Difference]: With dead ends: 2386 [2020-10-16 12:01:28,290 INFO L226 Difference]: Without dead ends: 2386 [2020-10-16 12:01:28,290 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:01:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-16 12:01:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-16 12:01:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-16 12:01:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-16 12:01:28,362 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-16 12:01:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,363 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-16 12:01:28,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-16 12:01:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:01:28,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:28,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:01:28,367 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 222355305, now seen corresponding path program 1 times [2020-10-16 12:01:28,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871451402] [2020-10-16 12:01:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:28,682 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:01:28,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871451402] [2020-10-16 12:01:28,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:28,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:28,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636379173] [2020-10-16 12:01:28,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:28,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:28,685 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-16 12:01:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:28,785 INFO L93 Difference]: Finished difference Result 2402 states and 9126 transitions. [2020-10-16 12:01:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:28,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:01:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:28,797 INFO L225 Difference]: With dead ends: 2402 [2020-10-16 12:01:28,797 INFO L226 Difference]: Without dead ends: 2402 [2020-10-16 12:01:28,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-10-16 12:01:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2402. [2020-10-16 12:01:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2020-10-16 12:01:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 9126 transitions. [2020-10-16 12:01:28,871 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 9126 transitions. Word has length 15 [2020-10-16 12:01:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:28,871 INFO L481 AbstractCegarLoop]: Abstraction has 2402 states and 9126 transitions. [2020-10-16 12:01:28,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 9126 transitions. [2020-10-16 12:01:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:01:28,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:28,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:28,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:01:28,875 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:28,875 INFO L82 PathProgramCache]: Analyzing trace with hash -93104110, now seen corresponding path program 1 times [2020-10-16 12:01:28,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:28,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289220956] [2020-10-16 12:01:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,036 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:01:29,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289220956] [2020-10-16 12:01:29,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:29,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484093132] [2020-10-16 12:01:29,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:29,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:29,040 INFO L87 Difference]: Start difference. First operand 2402 states and 9126 transitions. Second operand 5 states. [2020-10-16 12:01:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:29,146 INFO L93 Difference]: Finished difference Result 2474 states and 9390 transitions. [2020-10-16 12:01:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:29,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:01:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:29,158 INFO L225 Difference]: With dead ends: 2474 [2020-10-16 12:01:29,158 INFO L226 Difference]: Without dead ends: 2474 [2020-10-16 12:01:29,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2020-10-16 12:01:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2020-10-16 12:01:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2020-10-16 12:01:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9390 transitions. [2020-10-16 12:01:29,233 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 9390 transitions. Word has length 15 [2020-10-16 12:01:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:29,234 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 9390 transitions. [2020-10-16 12:01:29,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 9390 transitions. [2020-10-16 12:01:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:29,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,238 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:01:29,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:01:29,239 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash 554087654, now seen corresponding path program 1 times [2020-10-16 12:01:29,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378675911] [2020-10-16 12:01:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,370 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:01:29,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378675911] [2020-10-16 12:01:29,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:29,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262566778] [2020-10-16 12:01:29,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:29,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:29,372 INFO L87 Difference]: Start difference. First operand 2474 states and 9390 transitions. Second operand 6 states. [2020-10-16 12:01:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:29,520 INFO L93 Difference]: Finished difference Result 2538 states and 9582 transitions. [2020-10-16 12:01:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:29,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:29,532 INFO L225 Difference]: With dead ends: 2538 [2020-10-16 12:01:29,532 INFO L226 Difference]: Without dead ends: 2538 [2020-10-16 12:01:29,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2020-10-16 12:01:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2410. [2020-10-16 12:01:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:01:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-16 12:01:29,607 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 16 [2020-10-16 12:01:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:29,607 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-16 12:01:29,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-16 12:01:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:29,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:29,611 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:01:29,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:01:29,612 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2046082702, now seen corresponding path program 1 times [2020-10-16 12:01:29,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:29,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283050759] [2020-10-16 12:01:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:29,789 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:01:29,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283050759] [2020-10-16 12:01:29,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:29,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:29,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140528483] [2020-10-16 12:01:29,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:29,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:29,791 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-10-16 12:01:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:29,964 INFO L93 Difference]: Finished difference Result 2610 states and 9960 transitions. [2020-10-16 12:01:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:29,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:29,977 INFO L225 Difference]: With dead ends: 2610 [2020-10-16 12:01:29,977 INFO L226 Difference]: Without dead ends: 2610 [2020-10-16 12:01:29,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-16 12:01:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-16 12:01:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-16 12:01:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-16 12:01:30,061 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-16 12:01:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:30,061 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-16 12:01:30,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-16 12:01:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:01:30,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:30,066 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:01:30,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:01:30,066 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1696833598, now seen corresponding path program 2 times [2020-10-16 12:01:30,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:30,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880958405] [2020-10-16 12:01:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:30,323 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:01:30,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880958405] [2020-10-16 12:01:30,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:30,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:30,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862584584] [2020-10-16 12:01:30,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:30,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:30,325 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-16 12:01:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:30,482 INFO L93 Difference]: Finished difference Result 2906 states and 11010 transitions. [2020-10-16 12:01:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:30,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:01:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:30,494 INFO L225 Difference]: With dead ends: 2906 [2020-10-16 12:01:30,495 INFO L226 Difference]: Without dead ends: 2906 [2020-10-16 12:01:30,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-10-16 12:01:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2626. [2020-10-16 12:01:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2020-10-16 12:01:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 9932 transitions. [2020-10-16 12:01:30,575 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 9932 transitions. Word has length 16 [2020-10-16 12:01:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:30,576 INFO L481 AbstractCegarLoop]: Abstraction has 2626 states and 9932 transitions. [2020-10-16 12:01:30,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 9932 transitions. [2020-10-16 12:01:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:30,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:30,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:30,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:01:30,582 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash -555116367, now seen corresponding path program 1 times [2020-10-16 12:01:30,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:30,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784351189] [2020-10-16 12:01:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:30,932 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:01:30,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784351189] [2020-10-16 12:01:30,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:30,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:30,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142840264] [2020-10-16 12:01:30,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:30,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:30,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:30,935 INFO L87 Difference]: Start difference. First operand 2626 states and 9932 transitions. Second operand 7 states. [2020-10-16 12:01:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:31,214 INFO L93 Difference]: Finished difference Result 3466 states and 13054 transitions. [2020-10-16 12:01:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:31,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:01:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:31,227 INFO L225 Difference]: With dead ends: 3466 [2020-10-16 12:01:31,227 INFO L226 Difference]: Without dead ends: 3466 [2020-10-16 12:01:31,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2020-10-16 12:01:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 2922. [2020-10-16 12:01:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2020-10-16 12:01:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 11022 transitions. [2020-10-16 12:01:31,419 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 11022 transitions. Word has length 17 [2020-10-16 12:01:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:31,420 INFO L481 AbstractCegarLoop]: Abstraction has 2922 states and 11022 transitions. [2020-10-16 12:01:31,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 11022 transitions. [2020-10-16 12:01:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:31,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:31,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:31,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:01:31,429 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash -112806921, now seen corresponding path program 2 times [2020-10-16 12:01:31,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:31,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885376907] [2020-10-16 12:01:31,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:31,861 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:01:31,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885376907] [2020-10-16 12:01:31,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:31,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:31,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656334149] [2020-10-16 12:01:31,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:31,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:31,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:31,863 INFO L87 Difference]: Start difference. First operand 2922 states and 11022 transitions. Second operand 7 states. [2020-10-16 12:01:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,082 INFO L93 Difference]: Finished difference Result 3034 states and 11402 transitions. [2020-10-16 12:01:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:32,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 12:01:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,095 INFO L225 Difference]: With dead ends: 3034 [2020-10-16 12:01:32,096 INFO L226 Difference]: Without dead ends: 3034 [2020-10-16 12:01:32,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2020-10-16 12:01:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2714. [2020-10-16 12:01:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2020-10-16 12:01:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 10218 transitions. [2020-10-16 12:01:32,180 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 10218 transitions. Word has length 17 [2020-10-16 12:01:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,180 INFO L481 AbstractCegarLoop]: Abstraction has 2714 states and 10218 transitions. [2020-10-16 12:01:32,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 10218 transitions. [2020-10-16 12:01:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:01:32,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:32,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:01:32,187 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash 207234097, now seen corresponding path program 1 times [2020-10-16 12:01:32,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855673073] [2020-10-16 12:01:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,262 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:01:32,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855673073] [2020-10-16 12:01:32,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:32,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750867030] [2020-10-16 12:01:32,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:32,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:32,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:32,264 INFO L87 Difference]: Start difference. First operand 2714 states and 10218 transitions. Second operand 4 states. [2020-10-16 12:01:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,311 INFO L93 Difference]: Finished difference Result 2838 states and 9757 transitions. [2020-10-16 12:01:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:01:32,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-16 12:01:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,323 INFO L225 Difference]: With dead ends: 2838 [2020-10-16 12:01:32,323 INFO L226 Difference]: Without dead ends: 2094 [2020-10-16 12:01:32,324 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:01:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2020-10-16 12:01:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2020-10-16 12:01:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2020-10-16 12:01:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 7118 transitions. [2020-10-16 12:01:32,377 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 7118 transitions. Word has length 17 [2020-10-16 12:01:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,377 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 7118 transitions. [2020-10-16 12:01:32,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 7118 transitions. [2020-10-16 12:01:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:01:32,382 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,382 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:01:32,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:01:32,383 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:32,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash -791241669, now seen corresponding path program 1 times [2020-10-16 12:01:32,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602176901] [2020-10-16 12:01:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,475 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:01:32,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602176901] [2020-10-16 12:01:32,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:01:32,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473960989] [2020-10-16 12:01:32,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:01:32,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:01:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:01:32,478 INFO L87 Difference]: Start difference. First operand 2094 states and 7118 transitions. Second operand 5 states. [2020-10-16 12:01:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,552 INFO L93 Difference]: Finished difference Result 1824 states and 5733 transitions. [2020-10-16 12:01:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:01:32,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-16 12:01:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,560 INFO L225 Difference]: With dead ends: 1824 [2020-10-16 12:01:32,561 INFO L226 Difference]: Without dead ends: 1365 [2020-10-16 12:01:32,561 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:01:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-10-16 12:01:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2020-10-16 12:01:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2020-10-16 12:01:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 4202 transitions. [2020-10-16 12:01:32,605 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 4202 transitions. Word has length 18 [2020-10-16 12:01:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,605 INFO L481 AbstractCegarLoop]: Abstraction has 1365 states and 4202 transitions. [2020-10-16 12:01:32,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:01:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 4202 transitions. [2020-10-16 12:01:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:01:32,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:32,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:01:32,610 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 694225450, now seen corresponding path program 1 times [2020-10-16 12:01:32,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148234112] [2020-10-16 12:01:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,659 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:01:32,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148234112] [2020-10-16 12:01:32,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:01:32,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870198395] [2020-10-16 12:01:32,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:01:32,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:01:32,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:01:32,661 INFO L87 Difference]: Start difference. First operand 1365 states and 4202 transitions. Second operand 3 states. [2020-10-16 12:01:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,685 INFO L93 Difference]: Finished difference Result 1975 states and 5917 transitions. [2020-10-16 12:01:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:01:32,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-16 12:01:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,692 INFO L225 Difference]: With dead ends: 1975 [2020-10-16 12:01:32,693 INFO L226 Difference]: Without dead ends: 1377 [2020-10-16 12:01:32,693 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:01:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-10-16 12:01:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1325. [2020-10-16 12:01:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-10-16 12:01:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 3847 transitions. [2020-10-16 12:01:32,732 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 3847 transitions. Word has length 20 [2020-10-16 12:01:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,733 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 3847 transitions. [2020-10-16 12:01:32,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:01:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 3847 transitions. [2020-10-16 12:01:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:01:32,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,738 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:01:32,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:01:32,738 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -905674660, now seen corresponding path program 1 times [2020-10-16 12:01:32,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960756676] [2020-10-16 12:01:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:32,839 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:01:32,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960756676] [2020-10-16 12:01:32,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:32,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:01:32,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400275944] [2020-10-16 12:01:32,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:01:32,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:32,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:01:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:01:32,841 INFO L87 Difference]: Start difference. First operand 1325 states and 3847 transitions. Second operand 6 states. [2020-10-16 12:01:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:32,907 INFO L93 Difference]: Finished difference Result 1173 states and 3364 transitions. [2020-10-16 12:01:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:01:32,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-16 12:01:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:32,911 INFO L225 Difference]: With dead ends: 1173 [2020-10-16 12:01:32,911 INFO L226 Difference]: Without dead ends: 1031 [2020-10-16 12:01:32,911 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:01:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2020-10-16 12:01:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 959. [2020-10-16 12:01:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2020-10-16 12:01:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2791 transitions. [2020-10-16 12:01:32,934 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2791 transitions. Word has length 21 [2020-10-16 12:01:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:32,935 INFO L481 AbstractCegarLoop]: Abstraction has 959 states and 2791 transitions. [2020-10-16 12:01:32,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:01:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2791 transitions. [2020-10-16 12:01:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:01:32,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:32,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:32,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:01:32,938 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash -730235590, now seen corresponding path program 1 times [2020-10-16 12:01:32,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:32,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279951505] [2020-10-16 12:01:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:33,124 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:01:33,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279951505] [2020-10-16 12:01:33,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:33,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:01:33,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999702169] [2020-10-16 12:01:33,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:01:33,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:01:33,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:01:33,126 INFO L87 Difference]: Start difference. First operand 959 states and 2791 transitions. Second operand 7 states. [2020-10-16 12:01:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:33,210 INFO L93 Difference]: Finished difference Result 929 states and 2730 transitions. [2020-10-16 12:01:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:01:33,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 12:01:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:33,213 INFO L225 Difference]: With dead ends: 929 [2020-10-16 12:01:33,214 INFO L226 Difference]: Without dead ends: 573 [2020-10-16 12:01:33,214 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:01:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-10-16 12:01:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 517. [2020-10-16 12:01:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-16 12:01:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-10-16 12:01:33,231 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24 [2020-10-16 12:01:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:33,232 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-10-16 12:01:33,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:01:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-10-16 12:01:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:33,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:33,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:33,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:01:33,235 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash -126296697, now seen corresponding path program 1 times [2020-10-16 12:01:33,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:33,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059340656] [2020-10-16 12:01:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:33,303 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:01:33,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059340656] [2020-10-16 12:01:33,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:33,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:01:33,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276028289] [2020-10-16 12:01:33,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:01:33,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:33,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:01:33,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:01:33,305 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 4 states. [2020-10-16 12:01:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:33,330 INFO L93 Difference]: Finished difference Result 684 states and 1931 transitions. [2020-10-16 12:01:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:01:33,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-16 12:01:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:33,333 INFO L225 Difference]: With dead ends: 684 [2020-10-16 12:01:33,333 INFO L226 Difference]: Without dead ends: 214 [2020-10-16 12:01:33,334 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:01:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-16 12:01:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-16 12:01:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-16 12:01:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-16 12:01:33,341 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-16 12:01:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:33,341 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-16 12:01:33,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:01:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-16 12:01:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:33,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:33,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:33,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:01:33,343 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -666194943, now seen corresponding path program 2 times [2020-10-16 12:01:33,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:33,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144904038] [2020-10-16 12:01:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:01:34,013 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:01:34,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144904038] [2020-10-16 12:01:34,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:01:34,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:01:34,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534049912] [2020-10-16 12:01:34,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:01:34,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:01:34,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:01:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:01:34,022 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 9 states. [2020-10-16 12:01:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:01:34,413 INFO L93 Difference]: Finished difference Result 289 states and 715 transitions. [2020-10-16 12:01:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:01:34,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-16 12:01:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:01:34,415 INFO L225 Difference]: With dead ends: 289 [2020-10-16 12:01:34,415 INFO L226 Difference]: Without dead ends: 180 [2020-10-16 12:01:34,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:01:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-16 12:01:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2020-10-16 12:01:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-16 12:01:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-16 12:01:34,419 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-16 12:01:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:01:34,420 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-16 12:01:34,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:01:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-16 12:01:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:01:34,423 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:01:34,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:01:34,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:01:34,423 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:01:34,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:01:34,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1540373759, now seen corresponding path program 3 times [2020-10-16 12:01:34,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:01:34,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897451031] [2020-10-16 12:01:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:01:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:01:34,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:01:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:01:34,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:01:34,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:01:34,607 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:01:34,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:01:34,610 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:01:34,634 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-1786684710 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-1786684710 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-1786684710 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In-1786684710 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1786684710 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1786684710|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1786684710 0)) (or (and .cse0 (or (and .cse1 .cse2 (= ~y$w_buff1~0_In-1786684710 ~y~0_Out-1786684710)) (and (= ~y~0_Out-1786684710 ~y~0_In-1786684710) .cse3))) (and (= ~y~0_Out-1786684710 ~y$w_buff0~0_In-1786684710) .cse4 .cse5)) (or (and (= ~y$w_buff0_used~0_Out-1786684710 0) .cse4 .cse5) (and .cse0 (= ~y$w_buff0_used~0_Out-1786684710 ~y$w_buff0_used~0_In-1786684710))) (or (and (= ~y$w_buff1_used~0_In-1786684710 ~y$w_buff1_used~0_Out-1786684710) .cse3) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-1786684710 0))) (= ~y$r_buff1_thd0~0_In-1786684710 ~y$r_buff1_thd0~0_Out-1786684710) (= ~y$r_buff0_thd0~0_Out-1786684710 ~y$r_buff0_thd0~0_In-1786684710)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1786684710|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1786684710, ~y$w_buff1~0=~y$w_buff1~0_In-1786684710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1786684710, ~y$w_buff0~0=~y$w_buff0~0_In-1786684710, ~y~0=~y~0_In-1786684710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1786684710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1786684710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1786684710, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1786684710|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1786684710|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1786684710|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1786684710|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1786684710|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1786684710|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1786684710|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1786684710, ~y$w_buff1~0=~y$w_buff1~0_In-1786684710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1786684710, ~y$w_buff0~0=~y$w_buff0~0_In-1786684710, ~y~0=~y~0_Out-1786684710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1786684710, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1786684710} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:01:34,648 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:01:34,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,650 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:01:34,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,650 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:01:34,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,650 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:01:34,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,651 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:01:34,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,651 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:01:34,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,651 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:01:34,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,654 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:01:34,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,654 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:01:34,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,655 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:01:34,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,655 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:01:34,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,655 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:01:34,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,656 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:01:34,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,656 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:01:34,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,657 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:01:34,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,657 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:01:34,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,657 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:01:34,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,658 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:01:34,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,663 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:01:34,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,664 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:01:34,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,664 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:01:34,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,665 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:01:34,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,665 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:01:34,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,666 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:01:34,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,666 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:01:34,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,666 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:01:34,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,666 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:01:34,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,667 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:01:34,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,667 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:01:34,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,667 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:01:34,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,668 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:01:34,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:01:34,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:34 BasicIcfg [2020-10-16 12:01:34,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:01:34,775 INFO L168 Benchmark]: Toolchain (without parser) took 19118.40 ms. Allocated memory was 140.5 MB in the beginning and 474.0 MB in the end (delta: 333.4 MB). Free memory was 101.6 MB in the beginning and 135.6 MB in the end (delta: -34.0 MB). Peak memory consumption was 299.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,775 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.07 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.1 MB in the beginning and 159.0 MB in the end (delta: -57.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.04 ms. Allocated memory is still 203.4 MB. Free memory was 159.0 MB in the beginning and 156.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,777 INFO L168 Benchmark]: Boogie Preprocessor took 42.13 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,781 INFO L168 Benchmark]: RCFGBuilder took 2301.46 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 153.5 MB in the beginning and 163.0 MB in the end (delta: -9.5 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,782 INFO L168 Benchmark]: TraceAbstraction took 15982.46 ms. Allocated memory was 246.9 MB in the beginning and 474.0 MB in the end (delta: 227.0 MB). Free memory was 163.0 MB in the beginning and 135.6 MB in the end (delta: 27.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:01:34,785 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.07 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.1 MB in the beginning and 159.0 MB in the end (delta: -57.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.04 ms. Allocated memory is still 203.4 MB. Free memory was 159.0 MB in the beginning and 156.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.13 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2301.46 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 153.5 MB in the beginning and 163.0 MB in the end (delta: -9.5 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15982.46 ms. Allocated memory was 246.9 MB in the beginning and 474.0 MB in the end (delta: 227.0 MB). Free memory was 163.0 MB in the beginning and 135.6 MB in the end (delta: 27.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1339 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 131 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.8s, 121 PlacesBefore, 46 PlacesAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 7068 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_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 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; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff0_thd4; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$r_buff1_thd4; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t805; [L834] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t806; [L836] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t807; [L838] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 2 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L777] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L778] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L779] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L780] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L781] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L782] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 pthread_t t808; [L840] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L812] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L812] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L813] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L814] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L815] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L737] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L788] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L790] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L765] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 2 return 0; [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 722 SDtfs, 816 SDslu, 1238 SDs, 0 SdLazy, 572 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1464 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 63546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...