/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:35:20,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:35:20,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:35:20,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:35:20,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:35:20,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:35:20,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:35:20,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:35:20,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:35:20,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:35:20,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:35:20,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:35:20,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:35:20,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:35:20,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:35:20,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:35:20,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:35:20,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:35:20,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:35:20,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:35:20,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:35:20,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:35:20,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:35:20,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:35:20,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:35:20,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:35:20,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:35:20,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:35:20,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:35:20,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:35:20,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:35:20,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:35:20,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:35:20,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:35:20,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:35:20,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:35:20,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:35:20,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:35:20,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:35:20,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:35:20,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:35:20,382 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-McrAutomaton-WP.epf [2020-10-16 13:35:20,404 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:35:20,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:35:20,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:35:20,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:35:20,406 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:35:20,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:35:20,406 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:35:20,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:35:20,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:35:20,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:35:20,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:35:20,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:35:20,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:35:20,407 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:35:20,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:35:20,408 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:35:20,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:35:20,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:35:20,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:35:20,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:35:20,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:35:20,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:35:20,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:35:20,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:35:20,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:35:20,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:35:20,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:35:20,410 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:35:20,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:35:20,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:35:20,411 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:35:20,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:35:20,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:35:20,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:35:20,720 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:35:20,720 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:35:20,721 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-16 13:35:20,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8f41e1b9c/44e68bc7647341f1bf5ccb0e1ab979b3/FLAG83ab3dbc2 [2020-10-16 13:35:21,400 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:35:21,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-16 13:35:21,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8f41e1b9c/44e68bc7647341f1bf5ccb0e1ab979b3/FLAG83ab3dbc2 [2020-10-16 13:35:21,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8f41e1b9c/44e68bc7647341f1bf5ccb0e1ab979b3 [2020-10-16 13:35:21,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:35:21,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:35:21,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:35:21,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:35:21,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:35:21,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:21" (1/1) ... [2020-10-16 13:35:21,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af4bb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:21, skipping insertion in model container [2020-10-16 13:35:21,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:21" (1/1) ... [2020-10-16 13:35:21,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:35:21,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:35:22,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:35:22,221 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:35:22,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:35:22,370 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:35:22,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22 WrapperNode [2020-10-16 13:35:22,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:35:22,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:35:22,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:35:22,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:35:22,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 01:35:22" (1/1) ... [2020-10-16 13:35:22,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 01:35:22" (1/1) ... [2020-10-16 13:35:22,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:35:22,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:35:22,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:35:22,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:35:22,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (1/1) ... [2020-10-16 13:35:22,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:35:22,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:35:22,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:35:22,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:35:22,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (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 13:35:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:35:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:35:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:35:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:35:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:35:22,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:35:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:35:22,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:35:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:35:22,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:35:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:35:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:35:22,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:35:22,566 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 13:35:24,776 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:35:24,777 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:35:24,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:24 BoogieIcfgContainer [2020-10-16 13:35:24,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:35:24,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:35:24,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:35:24,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:35:24,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:35:21" (1/3) ... [2020-10-16 13:35:24,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19354de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:24, skipping insertion in model container [2020-10-16 13:35:24,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:22" (2/3) ... [2020-10-16 13:35:24,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19354de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:24, skipping insertion in model container [2020-10-16 13:35:24,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:24" (3/3) ... [2020-10-16 13:35:24,788 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2020-10-16 13:35:24,800 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:35:24,800 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:35:24,808 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:35:24,809 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:35:24,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,848 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,848 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,855 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,865 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,865 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,866 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:35:24,873 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:35:24,887 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:35:24,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:35:24,908 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:35:24,908 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:35:24,909 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:35:24,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:35:24,909 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:35:24,909 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:35:24,909 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:35:24,923 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:35:24,924 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 13:35:24,927 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 13:35:24,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 13:35:24,977 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 13:35:24,977 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:35:24,983 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 13:35:24,986 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 13:35:26,421 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 13:35:26,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 13:35:26,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:35:26,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 13:35:26,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:35:27,569 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-16 13:35:28,473 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 13:35:29,078 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 13:35:29,408 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 13:35:30,011 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 13:35:30,317 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 13:35:31,805 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-16 13:35:32,222 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 13:35:32,645 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 13:35:32,975 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 13:35:33,215 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 13:35:33,323 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 13:35:33,353 INFO L132 LiptonReduction]: Checked pairs total: 4586 [2020-10-16 13:35:33,353 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 13:35:33,360 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 13:35:33,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-16 13:35:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-16 13:35:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 13:35:33,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:33,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 13:35:33,450 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:33,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times [2020-10-16 13:35:33,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:33,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125734709] [2020-10-16 13:35:33,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:33,724 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 13:35:33,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125734709] [2020-10-16 13:35:33,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:33,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:35:33,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1254703463] [2020-10-16 13:35:33,729 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:33,732 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:33,750 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-16 13:35:33,750 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:33,754 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:33,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:35:33,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:35:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:35:33,773 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-16 13:35:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:33,886 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 13:35:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:35:33,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 13:35:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:33,911 INFO L225 Difference]: With dead ends: 687 [2020-10-16 13:35:33,911 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 13:35:33,913 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 13:35:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 13:35:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 13:35:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 13:35:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 13:35:34,020 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-16 13:35:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:34,020 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 13:35:34,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:35:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 13:35:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:35:34,022 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:34,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:34,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:35:34,023 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:34,024 INFO L82 PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times [2020-10-16 13:35:34,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:34,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756560117] [2020-10-16 13:35:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:34,180 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 13:35:34,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756560117] [2020-10-16 13:35:34,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:34,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:35:34,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221877220] [2020-10-16 13:35:34,181 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:34,183 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:34,184 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:35:34,185 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:34,185 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:34,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:35:34,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:35:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:35:34,187 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 13:35:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:34,236 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-16 13:35:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:35:34,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:35:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:34,243 INFO L225 Difference]: With dead ends: 557 [2020-10-16 13:35:34,243 INFO L226 Difference]: Without dead ends: 557 [2020-10-16 13:35:34,244 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 13:35:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-16 13:35:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-16 13:35:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-16 13:35:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-16 13:35:34,275 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-16 13:35:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:34,276 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-16 13:35:34,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:35:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-16 13:35:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:35:34,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:34,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:34,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:35:34,279 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1993949950, now seen corresponding path program 1 times [2020-10-16 13:35:34,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:34,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023218974] [2020-10-16 13:35:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:34,366 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 13:35:34,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023218974] [2020-10-16 13:35:34,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:34,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:35:34,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1830291339] [2020-10-16 13:35:34,367 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:34,369 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:34,372 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-16 13:35:34,372 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:34,409 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:34,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:34,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:34,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:34,481 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:34,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:35:34,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:35:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:35:34,483 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-16 13:35:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:34,518 INFO L93 Difference]: Finished difference Result 553 states and 1691 transitions. [2020-10-16 13:35:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:35:34,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 13:35:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:34,524 INFO L225 Difference]: With dead ends: 553 [2020-10-16 13:35:34,524 INFO L226 Difference]: Without dead ends: 553 [2020-10-16 13:35:34,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 13:35:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-16 13:35:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2020-10-16 13:35:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-16 13:35:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1691 transitions. [2020-10-16 13:35:34,544 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1691 transitions. Word has length 10 [2020-10-16 13:35:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:34,544 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 1691 transitions. [2020-10-16 13:35:34,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:35:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1691 transitions. [2020-10-16 13:35:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:35:34,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:34,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:34,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:35:34,547 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2146239772, now seen corresponding path program 1 times [2020-10-16 13:35:34,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:34,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124264114] [2020-10-16 13:35:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:34,634 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 13:35:34,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124264114] [2020-10-16 13:35:34,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:34,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:35:34,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936770356] [2020-10-16 13:35:34,636 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:34,637 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:34,640 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-10-16 13:35:34,640 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:34,681 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:34,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:35:34,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:35:34,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:35:34,682 INFO L87 Difference]: Start difference. First operand 553 states and 1691 transitions. Second operand 3 states. [2020-10-16 13:35:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:34,708 INFO L93 Difference]: Finished difference Result 548 states and 1672 transitions. [2020-10-16 13:35:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:35:34,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 13:35:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:34,714 INFO L225 Difference]: With dead ends: 548 [2020-10-16 13:35:34,714 INFO L226 Difference]: Without dead ends: 548 [2020-10-16 13:35:34,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 13:35:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-16 13:35:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-16 13:35:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-16 13:35:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1672 transitions. [2020-10-16 13:35:34,736 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1672 transitions. Word has length 10 [2020-10-16 13:35:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:34,736 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1672 transitions. [2020-10-16 13:35:34,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:35:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1672 transitions. [2020-10-16 13:35:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:35:34,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:34,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:34,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:35:34,743 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1716876556, now seen corresponding path program 1 times [2020-10-16 13:35:34,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:34,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219821624] [2020-10-16 13:35:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:34,840 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 13:35:34,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219821624] [2020-10-16 13:35:34,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:34,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:35:34,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895530921] [2020-10-16 13:35:34,844 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:34,845 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:34,849 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 40 transitions. [2020-10-16 13:35:34,849 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:34,954 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:34,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:35:34,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:35:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:35:34,955 INFO L87 Difference]: Start difference. First operand 548 states and 1672 transitions. Second operand 3 states. [2020-10-16 13:35:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:34,972 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2020-10-16 13:35:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:35:34,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 13:35:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:34,977 INFO L225 Difference]: With dead ends: 529 [2020-10-16 13:35:34,977 INFO L226 Difference]: Without dead ends: 529 [2020-10-16 13:35:34,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 13:35:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-16 13:35:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-10-16 13:35:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-16 13:35:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-16 13:35:34,995 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 11 [2020-10-16 13:35:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:34,996 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-16 13:35:34,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:35:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-16 13:35:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:35:34,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:34,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:34,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:35:34,998 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:34,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1682906291, now seen corresponding path program 1 times [2020-10-16 13:35:35,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:35,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053755496] [2020-10-16 13:35:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:35,047 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 13:35:35,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053755496] [2020-10-16 13:35:35,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:35,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:35:35,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965224567] [2020-10-16 13:35:35,049 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:35,050 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:35,055 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-16 13:35:35,055 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:35,080 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:35,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:35:35,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:35:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:35:35,082 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states. [2020-10-16 13:35:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:35,141 INFO L93 Difference]: Finished difference Result 1165 states and 3454 transitions. [2020-10-16 13:35:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:35:35,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:35:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:35,149 INFO L225 Difference]: With dead ends: 1165 [2020-10-16 13:35:35,149 INFO L226 Difference]: Without dead ends: 721 [2020-10-16 13:35:35,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 13:35:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-16 13:35:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 529. [2020-10-16 13:35:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-16 13:35:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1566 transitions. [2020-10-16 13:35:35,171 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1566 transitions. Word has length 11 [2020-10-16 13:35:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:35,172 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1566 transitions. [2020-10-16 13:35:35,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:35:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1566 transitions. [2020-10-16 13:35:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:35:35,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:35,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:35,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:35:35,173 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1055844487, now seen corresponding path program 2 times [2020-10-16 13:35:35,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:35,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541545251] [2020-10-16 13:35:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:35,224 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 13:35:35,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541545251] [2020-10-16 13:35:35,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:35,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:35:35,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856653685] [2020-10-16 13:35:35,226 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:35,228 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:35,266 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-16 13:35:35,266 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:35,277 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:35,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,318 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:35,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,356 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:35,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:35:35,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:35:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:35:35,358 INFO L87 Difference]: Start difference. First operand 529 states and 1566 transitions. Second operand 4 states. [2020-10-16 13:35:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:35,431 INFO L93 Difference]: Finished difference Result 513 states and 1510 transitions. [2020-10-16 13:35:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:35:35,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:35:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:35,436 INFO L225 Difference]: With dead ends: 513 [2020-10-16 13:35:35,436 INFO L226 Difference]: Without dead ends: 513 [2020-10-16 13:35:35,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 13:35:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-16 13:35:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-16 13:35:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-16 13:35:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1510 transitions. [2020-10-16 13:35:35,452 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1510 transitions. Word has length 11 [2020-10-16 13:35:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:35,452 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1510 transitions. [2020-10-16 13:35:35,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:35:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1510 transitions. [2020-10-16 13:35:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:35:35,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:35,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:35,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:35:35,454 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash 516480695, now seen corresponding path program 1 times [2020-10-16 13:35:35,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:35,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611775061] [2020-10-16 13:35:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:35,508 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 13:35:35,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611775061] [2020-10-16 13:35:35,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:35,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:35:35,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118846180] [2020-10-16 13:35:35,509 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:35,511 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:35,514 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2020-10-16 13:35:35,514 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:35,527 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:35,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:35,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:35,595 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:35,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:35:35,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:35:35,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:35:35,597 INFO L87 Difference]: Start difference. First operand 513 states and 1510 transitions. Second operand 4 states. [2020-10-16 13:35:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:35,672 INFO L93 Difference]: Finished difference Result 494 states and 1443 transitions. [2020-10-16 13:35:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:35:35,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 13:35:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:35,679 INFO L225 Difference]: With dead ends: 494 [2020-10-16 13:35:35,679 INFO L226 Difference]: Without dead ends: 494 [2020-10-16 13:35:35,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 13:35:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-16 13:35:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2020-10-16 13:35:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-10-16 13:35:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1443 transitions. [2020-10-16 13:35:35,700 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1443 transitions. Word has length 12 [2020-10-16 13:35:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:35,701 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1443 transitions. [2020-10-16 13:35:35,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:35:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1443 transitions. [2020-10-16 13:35:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:35:35,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:35,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:35,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:35:35,703 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1168968894, now seen corresponding path program 1 times [2020-10-16 13:35:35,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:35,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468957656] [2020-10-16 13:35:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:35,746 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 13:35:35,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468957656] [2020-10-16 13:35:35,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:35,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:35:35,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [695950073] [2020-10-16 13:35:35,748 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:35,751 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:35,756 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 35 transitions. [2020-10-16 13:35:35,756 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:35,779 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:35,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:35:35,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:35:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:35:35,780 INFO L87 Difference]: Start difference. First operand 494 states and 1443 transitions. Second operand 3 states. [2020-10-16 13:35:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:35,808 INFO L93 Difference]: Finished difference Result 665 states and 1896 transitions. [2020-10-16 13:35:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:35:35,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 13:35:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:35,813 INFO L225 Difference]: With dead ends: 665 [2020-10-16 13:35:35,813 INFO L226 Difference]: Without dead ends: 413 [2020-10-16 13:35:35,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 13:35:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-16 13:35:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 377. [2020-10-16 13:35:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-16 13:35:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1068 transitions. [2020-10-16 13:35:35,829 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1068 transitions. Word has length 13 [2020-10-16 13:35:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:35,830 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1068 transitions. [2020-10-16 13:35:35,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:35:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1068 transitions. [2020-10-16 13:35:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:35:35,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:35,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:35,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:35:35,832 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -549128060, now seen corresponding path program 1 times [2020-10-16 13:35:35,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:35,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38070170] [2020-10-16 13:35:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:35,942 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 13:35:35,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38070170] [2020-10-16 13:35:35,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:35,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:35:35,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16184128] [2020-10-16 13:35:35,944 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:35,946 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:35,951 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 46 transitions. [2020-10-16 13:35:35,951 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:35,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:35:35,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:35,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:35:35,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:35,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:35,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:35,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:35,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:35,979 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:35,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:35:36,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:35:36,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,053 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:36,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,064 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:36,066 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:36,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:35:36,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:35:36,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,106 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:36,111 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:36,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:36,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:36,124 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:36,270 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [16825#(and (<= ~__unbuffered_p2_EAX~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x$w_buff1~0)) (not (= ~x~0 ~x$w_buff0~0)) (= (mod ~x$r_buff0_thd0~0 256) 0)), 16826#(and (<= ~__unbuffered_p2_EAX~0 0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (= (mod ~x$r_buff0_thd0~0 256) 0)), 16827#(and (<= ~y~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x~0)) (= ~x~0 ~x$w_buff0~0))] [2020-10-16 13:35:36,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 13:35:36,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:36,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 13:35:36,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:35:36,273 INFO L87 Difference]: Start difference. First operand 377 states and 1068 transitions. Second operand 9 states. [2020-10-16 13:35:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:36,528 INFO L93 Difference]: Finished difference Result 403 states and 1152 transitions. [2020-10-16 13:35:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:35:36,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-16 13:35:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:36,532 INFO L225 Difference]: With dead ends: 403 [2020-10-16 13:35:36,532 INFO L226 Difference]: Without dead ends: 403 [2020-10-16 13:35:36,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-16 13:35:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-10-16 13:35:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 402. [2020-10-16 13:35:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-10-16 13:35:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1150 transitions. [2020-10-16 13:35:36,545 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1150 transitions. Word has length 13 [2020-10-16 13:35:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:36,546 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 1150 transitions. [2020-10-16 13:35:36,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 13:35:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1150 transitions. [2020-10-16 13:35:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:35:36,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:36,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:36,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:35:36,547 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1059606786, now seen corresponding path program 2 times [2020-10-16 13:35:36,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:36,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373392759] [2020-10-16 13:35:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:36,586 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 13:35:36,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373392759] [2020-10-16 13:35:36,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:36,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:35:36,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [489186522] [2020-10-16 13:35:36,587 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:36,589 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:36,593 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 31 transitions. [2020-10-16 13:35:36,594 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:36,641 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:36,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:35:36,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:35:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:35:36,642 INFO L87 Difference]: Start difference. First operand 402 states and 1150 transitions. Second operand 4 states. [2020-10-16 13:35:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:36,703 INFO L93 Difference]: Finished difference Result 558 states and 1580 transitions. [2020-10-16 13:35:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:35:36,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 13:35:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:36,706 INFO L225 Difference]: With dead ends: 558 [2020-10-16 13:35:36,706 INFO L226 Difference]: Without dead ends: 246 [2020-10-16 13:35:36,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 13:35:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-10-16 13:35:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2020-10-16 13:35:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-16 13:35:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 683 transitions. [2020-10-16 13:35:36,716 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 683 transitions. Word has length 13 [2020-10-16 13:35:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:36,716 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 683 transitions. [2020-10-16 13:35:36,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:35:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 683 transitions. [2020-10-16 13:35:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:35:36,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:36,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:36,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:35:36,718 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1878284186, now seen corresponding path program 1 times [2020-10-16 13:35:36,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:36,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590211905] [2020-10-16 13:35:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:36,768 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 13:35:36,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590211905] [2020-10-16 13:35:36,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:36,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:35:36,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1628087916] [2020-10-16 13:35:36,770 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:36,773 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:36,782 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2020-10-16 13:35:36,782 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:36,805 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:36,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:35:36,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:36,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:35:36,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:35:36,806 INFO L87 Difference]: Start difference. First operand 245 states and 683 transitions. Second operand 4 states. [2020-10-16 13:35:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:36,842 INFO L93 Difference]: Finished difference Result 353 states and 980 transitions. [2020-10-16 13:35:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:35:36,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 13:35:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:36,845 INFO L225 Difference]: With dead ends: 353 [2020-10-16 13:35:36,846 INFO L226 Difference]: Without dead ends: 209 [2020-10-16 13:35:36,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 13:35:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-16 13:35:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-16 13:35:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-16 13:35:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 563 transitions. [2020-10-16 13:35:36,854 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 563 transitions. Word has length 14 [2020-10-16 13:35:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:36,858 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 563 transitions. [2020-10-16 13:35:36,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:35:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 563 transitions. [2020-10-16 13:35:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:35:36,859 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:36,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:36,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:35:36,860 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1878298136, now seen corresponding path program 2 times [2020-10-16 13:35:36,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:36,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168891538] [2020-10-16 13:35:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:36,949 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 13:35:36,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168891538] [2020-10-16 13:35:36,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:36,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:35:36,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991954171] [2020-10-16 13:35:36,951 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:36,953 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:36,959 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions. [2020-10-16 13:35:36,960 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:36,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:35:36,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:35:36,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,973 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:36,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:36,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:36,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:36,986 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:36,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:35:37,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:35:37,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,033 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:37,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,047 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:37,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:35:37,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,072 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:35:37,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,073 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:37,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,087 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:35:37,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,094 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:37,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:37,105 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:37,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:35:37,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:35:37,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,170 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:37,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,189 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:35:37,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,197 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:37,203 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:37,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:37,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:37,239 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:37,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:35:37,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:37,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:35:37,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:35:37,240 INFO L87 Difference]: Start difference. First operand 209 states and 563 transitions. Second operand 5 states. [2020-10-16 13:35:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:37,324 INFO L93 Difference]: Finished difference Result 208 states and 559 transitions. [2020-10-16 13:35:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:35:37,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 13:35:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:37,328 INFO L225 Difference]: With dead ends: 208 [2020-10-16 13:35:37,328 INFO L226 Difference]: Without dead ends: 208 [2020-10-16 13:35:37,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:35:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-16 13:35:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2020-10-16 13:35:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-16 13:35:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 559 transitions. [2020-10-16 13:35:37,335 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 559 transitions. Word has length 14 [2020-10-16 13:35:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:37,335 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 559 transitions. [2020-10-16 13:35:37,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:35:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 559 transitions. [2020-10-16 13:35:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:35:37,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:37,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:35:37,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:35:37,337 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times [2020-10-16 13:35:37,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:37,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707994014] [2020-10-16 13:35:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:37,458 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 13:35:37,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707994014] [2020-10-16 13:35:37,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:37,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:35:37,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829769353] [2020-10-16 13:35:37,459 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:37,461 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:37,470 INFO L258 McrAutomatonBuilder]: Finished intersection with 47 states and 82 transitions. [2020-10-16 13:35:37,470 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:37,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:37,652 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20506#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-16 13:35:37,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:35:37,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:35:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:35:37,653 INFO L87 Difference]: Start difference. First operand 208 states and 559 transitions. Second operand 5 states. [2020-10-16 13:35:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:37,705 INFO L93 Difference]: Finished difference Result 146 states and 331 transitions. [2020-10-16 13:35:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:35:37,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 13:35:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:37,707 INFO L225 Difference]: With dead ends: 146 [2020-10-16 13:35:37,707 INFO L226 Difference]: Without dead ends: 93 [2020-10-16 13:35:37,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:35:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-16 13:35:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-16 13:35:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-16 13:35:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 179 transitions. [2020-10-16 13:35:37,711 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 179 transitions. Word has length 15 [2020-10-16 13:35:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:37,712 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 179 transitions. [2020-10-16 13:35:37,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:35:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 179 transitions. [2020-10-16 13:35:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 13:35:37,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:37,713 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 13:35:37,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 13:35:37,713 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times [2020-10-16 13:35:37,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:37,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598180879] [2020-10-16 13:35:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:37,868 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 13:35:37,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598180879] [2020-10-16 13:35:37,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:37,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:35:37,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994017017] [2020-10-16 13:35:37,870 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:37,872 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:37,883 INFO L258 McrAutomatonBuilder]: Finished intersection with 47 states and 76 transitions. [2020-10-16 13:35:37,883 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:37,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,002 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20849#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:35:38,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:35:38,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:35:38,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:35:38,003 INFO L87 Difference]: Start difference. First operand 93 states and 179 transitions. Second operand 7 states. [2020-10-16 13:35:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:38,052 INFO L93 Difference]: Finished difference Result 79 states and 149 transitions. [2020-10-16 13:35:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:35:38,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-16 13:35:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:38,054 INFO L225 Difference]: With dead ends: 79 [2020-10-16 13:35:38,054 INFO L226 Difference]: Without dead ends: 70 [2020-10-16 13:35:38,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:35:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-16 13:35:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-16 13:35:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-16 13:35:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2020-10-16 13:35:38,057 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 18 [2020-10-16 13:35:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:38,057 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2020-10-16 13:35:38,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:35:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2020-10-16 13:35:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:35:38,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:38,058 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 13:35:38,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 13:35:38,059 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times [2020-10-16 13:35:38,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:38,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386605449] [2020-10-16 13:35:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:35:38,278 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 13:35:38,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386605449] [2020-10-16 13:35:38,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:35:38,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:35:38,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382873178] [2020-10-16 13:35:38,280 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:35:38,287 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:35:38,300 INFO L258 McrAutomatonBuilder]: Finished intersection with 48 states and 74 transitions. [2020-10-16 13:35:38,300 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:35:38,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:35:38,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:35:38,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:35:38,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:38,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:38,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:38,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,391 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:38,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:35:38,404 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-16 13:35:38,408 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:35:38,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:38,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,436 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:38,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,499 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-16 13:35:38,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,519 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:38,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,535 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:38,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:38,558 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:38,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:38,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:38,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:38,994 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:35:39,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:39,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:39,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:39,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:39,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:39,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:39,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,120 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:35:40,125 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:35:40,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:35:40,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,193 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,228 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,266 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,281 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-16 13:35:40,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:35:40,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,362 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,365 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:35:40,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,377 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:35:40,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:35:40,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,397 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,407 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:35:40,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,446 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:35:40,452 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:35:40,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:35:40,477 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:35:40,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,669 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:35:40,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:35:40,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:35:40,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:35:40,812 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:35:40,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:35:40,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:35:40,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:35:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:35:40,813 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 8 states. [2020-10-16 13:35:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:35:40,936 INFO L93 Difference]: Finished difference Result 90 states and 168 transitions. [2020-10-16 13:35:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:35:40,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-16 13:35:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:35:40,938 INFO L225 Difference]: With dead ends: 90 [2020-10-16 13:35:40,938 INFO L226 Difference]: Without dead ends: 50 [2020-10-16 13:35:40,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:35:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-16 13:35:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-16 13:35:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-16 13:35:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-16 13:35:40,942 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-10-16 13:35:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:35:40,942 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-16 13:35:40,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:35:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-16 13:35:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:35:40,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:35:40,944 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 13:35:40,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 13:35:40,944 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:35:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:35:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times [2020-10-16 13:35:40,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:35:40,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674369536] [2020-10-16 13:35:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:35:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:35:40,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:35:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:35:41,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:35:41,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:35:41,079 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:35:41,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 13:35:41,080 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:35:41,097 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In-1763657246 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1763657246 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-1763657246 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In-1763657246 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1763657246| ULTIMATE.start_assume_abort_if_not_~cond_Out-1763657246) (or (and .cse0 (= ~x$w_buff1_used~0_In-1763657246 ~x$w_buff1_used~0_Out-1763657246)) (and .cse1 (= ~x$w_buff1_used~0_Out-1763657246 0) .cse2)) (or (and .cse3 .cse4 (= ~x$w_buff0_used~0_Out-1763657246 0)) (and .cse5 (= ~x$w_buff0_used~0_In-1763657246 ~x$w_buff0_used~0_Out-1763657246))) (or (and .cse3 .cse4 (= ~x~0_Out-1763657246 ~x$w_buff0~0_In-1763657246)) (and (or (and (= ~x~0_Out-1763657246 ~x$w_buff1~0_In-1763657246) .cse1 .cse2) (and .cse0 (= ~x~0_Out-1763657246 ~x~0_In-1763657246))) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1763657246 0)) (= ~x$r_buff1_thd0~0_Out-1763657246 ~x$r_buff1_thd0~0_In-1763657246) (= ~x$r_buff0_thd0~0_Out-1763657246 ~x$r_buff0_thd0~0_In-1763657246)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1763657246, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1763657246, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1763657246|, ~x$w_buff1~0=~x$w_buff1~0_In-1763657246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1763657246, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1763657246, ~x~0=~x~0_In-1763657246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1763657246} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1763657246, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1763657246, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1763657246|, ~x$w_buff1~0=~x$w_buff1~0_In-1763657246, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1763657246|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1763657246, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1763657246|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1763657246|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1763657246|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1763657246, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1763657246, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1763657246|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1763657246|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1763657246, ~x~0=~x~0_Out-1763657246} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 13:35:41,102 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 13:35:41,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,104 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 13:35:41,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,105 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 13:35:41,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,105 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 13:35:41,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,105 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 13:35:41,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,106 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 13:35:41,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,106 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 13:35:41,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,106 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 13:35:41,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,107 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 13:35:41,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,110 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 13:35:41,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,110 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 13:35:41,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,111 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 13:35:41,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,111 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 13:35:41,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,111 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 13:35:41,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,112 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 13:35:41,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,112 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 13:35:41,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,112 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 13:35:41,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,113 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 13:35:41,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,113 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 13:35:41,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,114 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 13:35:41,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,114 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 13:35:41,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,114 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 13:35:41,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,115 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 13:35:41,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,115 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 13:35:41,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,115 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 13:35:41,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,116 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 13:35:41,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,116 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 13:35:41,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,117 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 13:35:41,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,118 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 13:35:41,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,118 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 13:35:41,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,119 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 13:35:41,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,120 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 13:35:41,120 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:35:41,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:35:41 BasicIcfg [2020-10-16 13:35:41,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:35:41,189 INFO L168 Benchmark]: Toolchain (without parser) took 19559.82 ms. Allocated memory was 140.5 MB in the beginning and 493.4 MB in the end (delta: 352.8 MB). Free memory was 102.5 MB in the beginning and 328.7 MB in the end (delta: -226.2 MB). Peak memory consumption was 126.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,190 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.42 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 102.1 MB in the beginning and 159.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.31 ms. Allocated memory is still 203.9 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,192 INFO L168 Benchmark]: Boogie Preprocessor took 43.61 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,193 INFO L168 Benchmark]: RCFGBuilder took 2292.21 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 154.3 MB in the beginning and 162.8 MB in the end (delta: -8.5 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,194 INFO L168 Benchmark]: TraceAbstraction took 16406.29 ms. Allocated memory was 246.4 MB in the beginning and 493.4 MB in the end (delta: 246.9 MB). Free memory was 162.8 MB in the beginning and 328.7 MB in the end (delta: -165.9 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:35:41,197 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.14 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.42 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 102.1 MB in the beginning and 159.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.31 ms. Allocated memory is still 203.9 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.61 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2292.21 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 154.3 MB in the beginning and 162.8 MB in the end (delta: -8.5 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16406.29 ms. Allocated memory was 246.4 MB in the beginning and 493.4 MB in the end (delta: 246.9 MB). Free memory was 162.8 MB in the beginning and 328.7 MB in the end (delta: -165.9 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 822 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4586 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1888; [L808] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t1889; [L810] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 0 pthread_t t1890; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L785] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 354 SDtfs, 268 SDslu, 453 SDs, 0 SdLazy, 353 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 150 SyntacticMatches, 15 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 230 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 17009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...