/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:44:14,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:44:14,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:44:14,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:44:14,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:44:14,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:44:14,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:44:14,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:44:14,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:44:14,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:44:14,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:44:14,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:44:14,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:44:14,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:44:14,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:44:14,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:44:14,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:44:14,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:44:14,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:44:14,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:44:14,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:44:14,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:44:14,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:44:14,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:44:14,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:44:14,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:44:14,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:44:14,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:44:14,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:44:14,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:44:14,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:44:14,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:44:14,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:44:14,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:44:14,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:44:14,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:44:14,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:44:14,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:44:14,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:44:14,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:44:14,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:44:14,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 04:44:14,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:44:14,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:44:14,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:44:14,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:44:14,612 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:44:14,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:44:14,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:44:14,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:44:14,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:44:14,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:44:14,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:44:14,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:44:14,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:44:14,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:44:14,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:44:14,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:44:14,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:44:14,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:44:14,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:44:14,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:44:14,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:44:14,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:44:14,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:44:14,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:44:14,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:44:14,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:44:14,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:44:14,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:44:14,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:44:14,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:44:14,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:44:14,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:44:14,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:44:14,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:44:14,929 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:44:14,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 04:44:14,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e7d72af/a63cf1b2e04f4850a1ca012e4abea6e5/FLAG98d21fab2 [2019-12-27 04:44:15,471 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:44:15,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 04:44:15,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e7d72af/a63cf1b2e04f4850a1ca012e4abea6e5/FLAG98d21fab2 [2019-12-27 04:44:15,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e7d72af/a63cf1b2e04f4850a1ca012e4abea6e5 [2019-12-27 04:44:15,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:44:15,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:44:15,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:44:15,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:44:15,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:44:15,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:15" (1/1) ... [2019-12-27 04:44:15,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec3fc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:15, skipping insertion in model container [2019-12-27 04:44:15,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:15" (1/1) ... [2019-12-27 04:44:15,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:44:15,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:44:16,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:44:16,366 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:44:16,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:44:16,538 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:44:16,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16 WrapperNode [2019-12-27 04:44:16,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:44:16,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:44:16,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:44:16,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:44:16,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:44:16,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:44:16,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:44:16,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:44:16,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... [2019-12-27 04:44:16,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:44:16,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:44:16,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:44:16,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:44:16,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-12-27 04:44:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 04:44:16,677 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 04:44:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 04:44:16,677 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 04:44:16,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:44:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:44:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:44:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:44:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:44:16,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:44:16,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:44:16,680 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:44:17,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:44:17,020 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 04:44:17,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:17 BoogieIcfgContainer [2019-12-27 04:44:17,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:44:17,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:44:17,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:44:17,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:44:17,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:44:15" (1/3) ... [2019-12-27 04:44:17,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3147e4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:17, skipping insertion in model container [2019-12-27 04:44:17,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:16" (2/3) ... [2019-12-27 04:44:17,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3147e4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:17, skipping insertion in model container [2019-12-27 04:44:17,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:17" (3/3) ... [2019-12-27 04:44:17,028 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2019-12-27 04:44:17,036 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:44:17,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:44:17,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:44:17,046 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:44:17,071 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,072 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,072 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,072 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,073 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,073 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,073 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,074 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,074 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,074 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,075 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,075 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,075 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,075 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,076 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,076 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,076 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,076 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,077 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,077 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,077 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,078 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,078 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,078 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,079 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,079 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,079 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,079 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,083 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,084 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,084 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,084 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,085 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,085 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,091 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,091 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,091 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,091 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,092 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,092 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:17,108 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 04:44:17,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:44:17,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:44:17,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:44:17,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:44:17,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:44:17,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:44:17,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:44:17,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:44:17,142 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-27 04:44:17,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 04:44:17,183 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 04:44:17,184 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:44:17,189 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 04:44:17,193 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 04:44:17,210 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 04:44:17,210 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:44:17,211 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 04:44:17,214 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-27 04:44:17,215 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:44:18,292 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 04:44:18,404 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-27 04:44:18,405 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-27 04:44:18,409 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-27 04:44:18,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-27 04:44:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-27 04:44:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:44:18,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:18,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:44:18,432 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-27 04:44:18,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:18,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032153251] [2019-12-27 04:44:18,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:18,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032153251] [2019-12-27 04:44:18,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:18,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:44:18,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870569523] [2019-12-27 04:44:18,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:44:18,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:18,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:44:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:44:18,710 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-27 04:44:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:18,745 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-27 04:44:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:44:18,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:44:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:18,759 INFO L225 Difference]: With dead ends: 48 [2019-12-27 04:44:18,759 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 04:44:18,761 INFO L631 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 [2019-12-27 04:44:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 04:44:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 04:44:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 04:44:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-27 04:44:18,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-27 04:44:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:18,801 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-27 04:44:18,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:44:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-27 04:44:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:44:18,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:18,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:18,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-27 04:44:18,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:18,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371102527] [2019-12-27 04:44:18,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:18,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371102527] [2019-12-27 04:44:18,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:18,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:44:18,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123032101] [2019-12-27 04:44:18,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:44:18,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:44:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:44:18,933 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-27 04:44:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:18,984 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 04:44:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:44:18,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 04:44:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:18,986 INFO L225 Difference]: With dead ends: 34 [2019-12-27 04:44:18,986 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 04:44:18,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:44:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 04:44:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 04:44:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 04:44:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 04:44:18,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-27 04:44:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:18,999 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 04:44:18,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:44:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 04:44:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:44:19,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:19,002 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-27 04:44:19,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:19,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723351814] [2019-12-27 04:44:19,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723351814] [2019-12-27 04:44:19,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:19,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:44:19,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071732526] [2019-12-27 04:44:19,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:44:19,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:44:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:44:19,094 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-27 04:44:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:19,127 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 04:44:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:44:19,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:44:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:19,129 INFO L225 Difference]: With dead ends: 34 [2019-12-27 04:44:19,130 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 04:44:19,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:44:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 04:44:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-27 04:44:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 04:44:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 04:44:19,135 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-27 04:44:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:19,135 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 04:44:19,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:44:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 04:44:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:44:19,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:19,137 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-27 04:44:19,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:19,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620227424] [2019-12-27 04:44:19,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620227424] [2019-12-27 04:44:19,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:19,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:44:19,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207841751] [2019-12-27 04:44:19,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:44:19,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:44:19,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:44:19,207 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-27 04:44:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:19,245 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 04:44:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:44:19,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:44:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:19,247 INFO L225 Difference]: With dead ends: 32 [2019-12-27 04:44:19,247 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 04:44:19,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:44:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 04:44:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 04:44:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 04:44:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 04:44:19,252 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-27 04:44:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:19,253 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 04:44:19,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:44:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 04:44:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:44:19,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,254 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:19,254 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-27 04:44:19,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:19,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640870313] [2019-12-27 04:44:19,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640870313] [2019-12-27 04:44:19,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075576841] [2019-12-27 04:44:19,321 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:19,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:44:19,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:19,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:44:19,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:19,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 04:44:19,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569621245] [2019-12-27 04:44:19,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:44:19,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:44:19,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:44:19,422 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-27 04:44:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:19,478 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 04:44:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:44:19,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 04:44:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:19,480 INFO L225 Difference]: With dead ends: 32 [2019-12-27 04:44:19,480 INFO L226 Difference]: Without dead ends: 29 [2019-12-27 04:44:19,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:44:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-27 04:44:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-27 04:44:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 04:44:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 04:44:19,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-27 04:44:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:19,486 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 04:44:19,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:44:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 04:44:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:44:19,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,487 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:19,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:19,697 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-27 04:44:19,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:19,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468263013] [2019-12-27 04:44:19,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468263013] [2019-12-27 04:44:19,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228596250] [2019-12-27 04:44:19,765 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:19,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:19,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:19,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:44:19,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:19,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 04:44:19,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308299313] [2019-12-27 04:44:19,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:44:19,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:44:19,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:44:19,828 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-27 04:44:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:19,919 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-27 04:44:19,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:44:19,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 04:44:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:19,923 INFO L225 Difference]: With dead ends: 33 [2019-12-27 04:44:19,923 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 04:44:19,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:44:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 04:44:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 04:44:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 04:44:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 04:44:19,931 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-27 04:44:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:19,931 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 04:44:19,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:44:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 04:44:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:44:19,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,932 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:20,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,133 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-27 04:44:20,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:20,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294346703] [2019-12-27 04:44:20,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294346703] [2019-12-27 04:44:20,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190241924] [2019-12-27 04:44:20,227 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:20,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:20,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 04:44:20,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:20,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 04:44:20,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638883370] [2019-12-27 04:44:20,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:44:20,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:44:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:44:20,320 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-27 04:44:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:20,411 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 04:44:20,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:44:20,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-27 04:44:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:20,412 INFO L225 Difference]: With dead ends: 34 [2019-12-27 04:44:20,413 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 04:44:20,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 04:44:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-27 04:44:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 04:44:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-27 04:44:20,423 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-27 04:44:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:20,423 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-27 04:44:20,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:44:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-27 04:44:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:44:20,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:20,424 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:20,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,626 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-27 04:44:20,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:20,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786898241] [2019-12-27 04:44:20,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786898241] [2019-12-27 04:44:20,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889831146] [2019-12-27 04:44:20,747 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 04:44:20,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:20,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 04:44:20,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:20,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 04:44:20,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255521005] [2019-12-27 04:44:20,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:44:20,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:44:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:44:20,869 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-27 04:44:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:20,967 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-27 04:44:20,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:44:20,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-27 04:44:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:20,969 INFO L225 Difference]: With dead ends: 35 [2019-12-27 04:44:20,969 INFO L226 Difference]: Without dead ends: 32 [2019-12-27 04:44:20,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-27 04:44:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-27 04:44:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 04:44:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 04:44:20,976 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-27 04:44:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:20,976 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 04:44:20,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:44:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 04:44:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:44:20,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:20,977 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:21,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,187 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-27 04:44:21,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:21,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469603915] [2019-12-27 04:44:21,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:21,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469603915] [2019-12-27 04:44:21,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965028323] [2019-12-27 04:44:21,273 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:21,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:44:21,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:21,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:21,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 04:44:21,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405662802] [2019-12-27 04:44:21,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:44:21,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:44:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:44:21,339 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-27 04:44:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:21,428 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-27 04:44:21,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:44:21,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-27 04:44:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:21,429 INFO L225 Difference]: With dead ends: 36 [2019-12-27 04:44:21,429 INFO L226 Difference]: Without dead ends: 33 [2019-12-27 04:44:21,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:44:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-27 04:44:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-27 04:44:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 04:44:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-27 04:44:21,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-27 04:44:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:21,434 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-27 04:44:21,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:44:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-27 04:44:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:44:21,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:21,435 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:21,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,642 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-27 04:44:21,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:21,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538993146] [2019-12-27 04:44:21,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:21,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538993146] [2019-12-27 04:44:21,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74162073] [2019-12-27 04:44:21,696 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:21,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:21,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:44:21,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:21,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:21,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 04:44:21,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899373164] [2019-12-27 04:44:21,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:44:21,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:44:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:44:21,760 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-27 04:44:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:21,860 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-27 04:44:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:44:21,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-27 04:44:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:21,861 INFO L225 Difference]: With dead ends: 37 [2019-12-27 04:44:21,861 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 04:44:21,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:44:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 04:44:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 04:44:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 04:44:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 04:44:21,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-27 04:44:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:21,867 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 04:44:21,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:44:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 04:44:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:44:21,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:21,868 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:22,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,071 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-27 04:44:22,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:22,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358541461] [2019-12-27 04:44:22,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358541461] [2019-12-27 04:44:22,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486789394] [2019-12-27 04:44:22,138 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:44:22,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:22,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 04:44:22,215 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:22,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 04:44:22,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328706830] [2019-12-27 04:44:22,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:44:22,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:44:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:44:22,247 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-27 04:44:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:22,381 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-27 04:44:22,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:44:22,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-27 04:44:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:22,384 INFO L225 Difference]: With dead ends: 38 [2019-12-27 04:44:22,384 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 04:44:22,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:44:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 04:44:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-27 04:44:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-27 04:44:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-27 04:44:22,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-27 04:44:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:22,390 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-27 04:44:22,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:44:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-27 04:44:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:44:22,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:22,391 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:22,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,596 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-27 04:44:22,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:22,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179955093] [2019-12-27 04:44:22,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179955093] [2019-12-27 04:44:22,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059008823] [2019-12-27 04:44:22,676 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:22,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:22,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:44:22,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:22,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 04:44:22,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082598823] [2019-12-27 04:44:22,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:44:22,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:44:22,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:44:22,743 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-27 04:44:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:22,877 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-27 04:44:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:44:22,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-27 04:44:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:22,878 INFO L225 Difference]: With dead ends: 39 [2019-12-27 04:44:22,878 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 04:44:22,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:44:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 04:44:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 04:44:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 04:44:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 04:44:22,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-27 04:44:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:22,883 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 04:44:22,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:44:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 04:44:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:44:22,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:22,884 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:23,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,092 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-27 04:44:23,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:23,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498590984] [2019-12-27 04:44:23,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:23,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498590984] [2019-12-27 04:44:23,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819111352] [2019-12-27 04:44:23,168 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 04:44:23,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:23,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 04:44:23,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:23,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:23,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 04:44:23,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254552492] [2019-12-27 04:44:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:44:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:44:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:44:23,240 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-27 04:44:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:23,368 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-27 04:44:23,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:44:23,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 04:44:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:23,369 INFO L225 Difference]: With dead ends: 40 [2019-12-27 04:44:23,369 INFO L226 Difference]: Without dead ends: 37 [2019-12-27 04:44:23,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:44:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-27 04:44:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-27 04:44:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-27 04:44:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-27 04:44:23,372 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-27 04:44:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:23,373 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-27 04:44:23,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:44:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-27 04:44:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:44:23,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:23,374 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:23,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,577 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-27 04:44:23,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:23,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604216461] [2019-12-27 04:44:23,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:23,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604216461] [2019-12-27 04:44:23,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648303756] [2019-12-27 04:44:23,665 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,725 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 04:44:23,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:23,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:44:23,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:23,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:23,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 04:44:23,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2809968] [2019-12-27 04:44:23,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:44:23,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:44:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:44:23,749 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-27 04:44:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:23,924 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-27 04:44:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:44:23,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 04:44:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:23,926 INFO L225 Difference]: With dead ends: 41 [2019-12-27 04:44:23,926 INFO L226 Difference]: Without dead ends: 38 [2019-12-27 04:44:23,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:44:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-27 04:44:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-27 04:44:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 04:44:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 04:44:23,931 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-27 04:44:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:23,931 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 04:44:23,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:44:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 04:44:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:44:23,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:23,932 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:24,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,136 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-27 04:44:24,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:24,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940237563] [2019-12-27 04:44:24,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940237563] [2019-12-27 04:44:24,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128691521] [2019-12-27 04:44:24,216 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:24,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:44:24,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:24,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 04:44:24,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818898753] [2019-12-27 04:44:24,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:44:24,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:44:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:24,301 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-27 04:44:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:24,486 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-27 04:44:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:44:24,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:44:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:24,488 INFO L225 Difference]: With dead ends: 42 [2019-12-27 04:44:24,488 INFO L226 Difference]: Without dead ends: 39 [2019-12-27 04:44:24,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-27 04:44:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-27 04:44:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-27 04:44:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-27 04:44:24,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-27 04:44:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:24,495 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-27 04:44:24,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:44:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-27 04:44:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:44:24,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:24,496 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:24,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-27 04:44:24,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:24,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084852670] [2019-12-27 04:44:24,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084852670] [2019-12-27 04:44:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876069217] [2019-12-27 04:44:24,800 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:24,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:24,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:44:24,874 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:24,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 04:44:24,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004297951] [2019-12-27 04:44:24,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:44:24,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:44:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:24,926 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-27 04:44:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:25,082 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-27 04:44:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:44:25,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:44:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:25,083 INFO L225 Difference]: With dead ends: 43 [2019-12-27 04:44:25,083 INFO L226 Difference]: Without dead ends: 40 [2019-12-27 04:44:25,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-27 04:44:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-27 04:44:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 04:44:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 04:44:25,090 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-27 04:44:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:25,090 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 04:44:25,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:44:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 04:44:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:44:25,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:25,091 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:25,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:25,297 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-27 04:44:25,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:25,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237973815] [2019-12-27 04:44:25,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:25,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237973815] [2019-12-27 04:44:25,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629010381] [2019-12-27 04:44:25,382 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:25,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 04:44:25,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:25,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 04:44:25,432 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:25,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:25,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 04:44:25,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946093338] [2019-12-27 04:44:25,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:44:25,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:44:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:44:25,461 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-27 04:44:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:25,662 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-27 04:44:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:44:25,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 04:44:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:25,671 INFO L225 Difference]: With dead ends: 44 [2019-12-27 04:44:25,671 INFO L226 Difference]: Without dead ends: 41 [2019-12-27 04:44:25,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:44:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-27 04:44:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-27 04:44:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 04:44:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 04:44:25,674 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-27 04:44:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:25,674 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 04:44:25,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:44:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 04:44:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:44:25,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:25,675 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:25,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:25,884 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:25,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-27 04:44:25,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:25,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567874510] [2019-12-27 04:44:25,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:25,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567874510] [2019-12-27 04:44:25,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471533371] [2019-12-27 04:44:25,971 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:26,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:26,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:26,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 04:44:26,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:26,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:26,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 04:44:26,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168661994] [2019-12-27 04:44:26,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:44:26,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:26,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:44:26,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:44:26,058 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-27 04:44:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:26,237 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-27 04:44:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 04:44:26,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 04:44:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:26,238 INFO L225 Difference]: With dead ends: 45 [2019-12-27 04:44:26,238 INFO L226 Difference]: Without dead ends: 42 [2019-12-27 04:44:26,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:44:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-27 04:44:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-27 04:44:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 04:44:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 04:44:26,242 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-27 04:44:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:26,242 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 04:44:26,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:44:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 04:44:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:44:26,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:26,243 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:26,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:26,447 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-27 04:44:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383288084] [2019-12-27 04:44:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:26,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383288084] [2019-12-27 04:44:26,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966334174] [2019-12-27 04:44:26,567 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:26,618 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 04:44:26,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:26,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 04:44:26,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:26,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:26,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 04:44:26,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250813126] [2019-12-27 04:44:26,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:44:26,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:26,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:44:26,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:44:26,643 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 14 states. [2019-12-27 04:44:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:26,866 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-27 04:44:26,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:44:26,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 04:44:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:26,869 INFO L225 Difference]: With dead ends: 46 [2019-12-27 04:44:26,869 INFO L226 Difference]: Without dead ends: 43 [2019-12-27 04:44:26,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:44:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-27 04:44:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-27 04:44:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-27 04:44:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-27 04:44:26,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-27 04:44:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:26,873 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-27 04:44:26,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:44:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-27 04:44:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:44:26,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:26,874 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:27,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,083 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-27 04:44:27,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:27,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942564576] [2019-12-27 04:44:27,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:27,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942564576] [2019-12-27 04:44:27,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125541836] [2019-12-27 04:44:27,188 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,251 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 04:44:27,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:27,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 04:44:27,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:27,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:27,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 04:44:27,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15972583] [2019-12-27 04:44:27,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:44:27,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:44:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:44:27,279 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 14 states. [2019-12-27 04:44:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:27,527 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-27 04:44:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:44:27,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 04:44:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:27,530 INFO L225 Difference]: With dead ends: 47 [2019-12-27 04:44:27,530 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 04:44:27,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:44:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 04:44:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 04:44:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 04:44:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 04:44:27,533 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-27 04:44:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:27,533 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 04:44:27,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:44:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 04:44:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:44:27,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:27,534 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:27,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,739 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-27 04:44:27,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:27,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281397285] [2019-12-27 04:44:27,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:27,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281397285] [2019-12-27 04:44:27,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598223385] [2019-12-27 04:44:27,843 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:27,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 04:44:27,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:27,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:27,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 04:44:27,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249454674] [2019-12-27 04:44:27,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:44:27,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:44:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:44:27,913 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 15 states. [2019-12-27 04:44:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:28,130 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2019-12-27 04:44:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:44:28,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:44:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:28,131 INFO L225 Difference]: With dead ends: 48 [2019-12-27 04:44:28,132 INFO L226 Difference]: Without dead ends: 45 [2019-12-27 04:44:28,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:44:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-27 04:44:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-27 04:44:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 04:44:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 04:44:28,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 18 [2019-12-27 04:44:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:28,136 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 04:44:28,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:44:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 04:44:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:44:28,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:28,137 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:28,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:28,340 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-27 04:44:28,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:28,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117950448] [2019-12-27 04:44:28,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:28,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117950448] [2019-12-27 04:44:28,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690705060] [2019-12-27 04:44:28,432 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:28,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:28,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:28,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 04:44:28,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:28,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:28,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 04:44:28,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114354809] [2019-12-27 04:44:28,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:44:28,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:44:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:44:28,532 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 15 states. [2019-12-27 04:44:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:28,770 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-27 04:44:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:44:28,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:44:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:28,771 INFO L225 Difference]: With dead ends: 49 [2019-12-27 04:44:28,771 INFO L226 Difference]: Without dead ends: 46 [2019-12-27 04:44:28,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:44:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-27 04:44:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-27 04:44:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-27 04:44:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-27 04:44:28,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 18 [2019-12-27 04:44:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:28,776 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-27 04:44:28,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:44:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-27 04:44:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:44:28,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:28,777 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:28,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:28,978 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2080307442, now seen corresponding path program 21 times [2019-12-27 04:44:28,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:28,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303180360] [2019-12-27 04:44:28,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303180360] [2019-12-27 04:44:29,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377340258] [2019-12-27 04:44:29,106 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:29,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 04:44:29,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:29,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 04:44:29,158 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:29,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 04:44:29,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307852950] [2019-12-27 04:44:29,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:44:29,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:44:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:44:29,187 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 16 states. [2019-12-27 04:44:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:29,426 INFO L93 Difference]: Finished difference Result 50 states and 102 transitions. [2019-12-27 04:44:29,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:44:29,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-27 04:44:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:29,428 INFO L225 Difference]: With dead ends: 50 [2019-12-27 04:44:29,428 INFO L226 Difference]: Without dead ends: 47 [2019-12-27 04:44:29,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:44:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-27 04:44:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-12-27 04:44:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 04:44:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 64 transitions. [2019-12-27 04:44:29,432 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 64 transitions. Word has length 19 [2019-12-27 04:44:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:29,432 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 64 transitions. [2019-12-27 04:44:29,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:44:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 64 transitions. [2019-12-27 04:44:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:44:29,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:29,433 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:29,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:29,637 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:29,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1609121454, now seen corresponding path program 22 times [2019-12-27 04:44:29,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:29,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107281485] [2019-12-27 04:44:29,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107281485] [2019-12-27 04:44:29,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560225009] [2019-12-27 04:44:29,774 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:29,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:29,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:29,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 04:44:29,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:29,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 04:44:29,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900768544] [2019-12-27 04:44:29,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:44:29,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:44:29,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:44:29,859 INFO L87 Difference]: Start difference. First operand 31 states and 64 transitions. Second operand 16 states. [2019-12-27 04:44:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:30,115 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-12-27 04:44:30,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:44:30,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-27 04:44:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:30,116 INFO L225 Difference]: With dead ends: 51 [2019-12-27 04:44:30,116 INFO L226 Difference]: Without dead ends: 48 [2019-12-27 04:44:30,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:44:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-27 04:44:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-27 04:44:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-27 04:44:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-27 04:44:30,119 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 19 [2019-12-27 04:44:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:30,119 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-27 04:44:30,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:44:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-27 04:44:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:44:30,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:30,123 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:30,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:30,324 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash -65021205, now seen corresponding path program 23 times [2019-12-27 04:44:30,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:30,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952415710] [2019-12-27 04:44:30,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:30,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952415710] [2019-12-27 04:44:30,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782305005] [2019-12-27 04:44:30,444 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:30,495 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 04:44:30,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:30,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 04:44:30,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:30,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:30,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 04:44:30,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607897539] [2019-12-27 04:44:30,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:44:30,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:30,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:44:30,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:44:30,537 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 17 states. [2019-12-27 04:44:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:30,837 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. [2019-12-27 04:44:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:44:30,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-27 04:44:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:30,839 INFO L225 Difference]: With dead ends: 52 [2019-12-27 04:44:30,839 INFO L226 Difference]: Without dead ends: 49 [2019-12-27 04:44:30,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=538, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:44:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-27 04:44:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2019-12-27 04:44:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 04:44:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 04:44:30,843 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 20 [2019-12-27 04:44:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:30,843 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 04:44:30,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:44:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 04:44:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:44:30,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:30,844 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:31,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:31,048 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1656842783, now seen corresponding path program 24 times [2019-12-27 04:44:31,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:31,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584637735] [2019-12-27 04:44:31,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:31,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584637735] [2019-12-27 04:44:31,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025479573] [2019-12-27 04:44:31,182 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:31,235 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 04:44:31,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:31,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 04:44:31,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:31,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:31,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 04:44:31,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527670337] [2019-12-27 04:44:31,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:44:31,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:44:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:44:31,257 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 17 states. [2019-12-27 04:44:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:31,550 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-12-27 04:44:31,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:44:31,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-27 04:44:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:31,552 INFO L225 Difference]: With dead ends: 53 [2019-12-27 04:44:31,552 INFO L226 Difference]: Without dead ends: 50 [2019-12-27 04:44:31,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=596, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:44:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-27 04:44:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-27 04:44:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-27 04:44:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-27 04:44:31,556 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 20 [2019-12-27 04:44:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:31,556 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-27 04:44:31,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:44:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-27 04:44:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:44:31,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:31,557 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:31,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:31,760 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 25 times [2019-12-27 04:44:31,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:31,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023370153] [2019-12-27 04:44:31,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023370153] [2019-12-27 04:44:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882864113] [2019-12-27 04:44:31,891 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:31,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 04:44:31,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:31,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:31,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 04:44:31,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445701048] [2019-12-27 04:44:31,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:44:31,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:31,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:44:31,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:44:31,964 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 18 states. [2019-12-27 04:44:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:32,304 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2019-12-27 04:44:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:44:32,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-27 04:44:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:32,305 INFO L225 Difference]: With dead ends: 54 [2019-12-27 04:44:32,305 INFO L226 Difference]: Without dead ends: 51 [2019-12-27 04:44:32,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=662, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:44:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-27 04:44:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-12-27 04:44:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-27 04:44:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-27 04:44:32,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 21 [2019-12-27 04:44:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:32,308 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-27 04:44:32,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:44:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-27 04:44:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:44:32,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:32,309 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:32,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:32,510 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:32,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:32,511 INFO L82 PathProgramCache]: Analyzing trace with hash -177481222, now seen corresponding path program 26 times [2019-12-27 04:44:32,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:32,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604595855] [2019-12-27 04:44:32,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:32,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604595855] [2019-12-27 04:44:32,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992995573] [2019-12-27 04:44:32,638 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:32,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:32,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:32,691 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 04:44:32,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:32,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:32,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 04:44:32,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574021337] [2019-12-27 04:44:32,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:44:32,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:32,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:44:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:44:32,719 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 18 states. [2019-12-27 04:44:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:33,020 INFO L93 Difference]: Finished difference Result 55 states and 112 transitions. [2019-12-27 04:44:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:44:33,021 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-27 04:44:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:33,021 INFO L225 Difference]: With dead ends: 55 [2019-12-27 04:44:33,022 INFO L226 Difference]: Without dead ends: 52 [2019-12-27 04:44:33,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:44:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-27 04:44:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-27 04:44:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-27 04:44:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-27 04:44:33,025 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 21 [2019-12-27 04:44:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:33,026 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-27 04:44:33,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:44:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-27 04:44:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:44:33,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:33,027 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:33,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:33,230 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1939140947, now seen corresponding path program 27 times [2019-12-27 04:44:33,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:33,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877613038] [2019-12-27 04:44:33,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:33,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877613038] [2019-12-27 04:44:33,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168706281] [2019-12-27 04:44:33,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:33,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-27 04:44:33,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:33,423 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 04:44:33,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:33,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:33,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 04:44:33,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213784479] [2019-12-27 04:44:33,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:44:33,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:44:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:44:33,449 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 19 states. [2019-12-27 04:44:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:33,825 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2019-12-27 04:44:33,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:44:33,826 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-27 04:44:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:33,826 INFO L225 Difference]: With dead ends: 56 [2019-12-27 04:44:33,827 INFO L226 Difference]: Without dead ends: 53 [2019-12-27 04:44:33,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:44:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-27 04:44:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-12-27 04:44:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 04:44:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 04:44:33,833 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 22 [2019-12-27 04:44:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:33,833 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 04:44:33,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:44:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 04:44:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:44:33,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:33,834 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:34,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:34,035 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1206950281, now seen corresponding path program 28 times [2019-12-27 04:44:34,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:34,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87708445] [2019-12-27 04:44:34,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:34,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87708445] [2019-12-27 04:44:34,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66883964] [2019-12-27 04:44:34,183 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:34,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:34,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:34,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 04:44:34,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:34,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:34,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 04:44:34,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518485303] [2019-12-27 04:44:34,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:44:34,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:34,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:44:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:44:34,305 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 19 states. [2019-12-27 04:44:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:34,743 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-27 04:44:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:44:34,744 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-27 04:44:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:34,745 INFO L225 Difference]: With dead ends: 57 [2019-12-27 04:44:34,745 INFO L226 Difference]: Without dead ends: 54 [2019-12-27 04:44:34,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=751, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 04:44:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-27 04:44:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-27 04:44:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-27 04:44:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-27 04:44:34,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 22 [2019-12-27 04:44:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:34,749 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-27 04:44:34,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:44:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-27 04:44:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:44:34,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:34,750 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:34,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:34,955 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash -16172482, now seen corresponding path program 29 times [2019-12-27 04:44:34,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:34,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667643890] [2019-12-27 04:44:34,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:35,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667643890] [2019-12-27 04:44:35,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427564024] [2019-12-27 04:44:35,145 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:35,198 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-27 04:44:35,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:35,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 04:44:35,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:35,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:35,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 04:44:35,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823986507] [2019-12-27 04:44:35,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:44:35,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:35,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:44:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:35,225 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 20 states. [2019-12-27 04:44:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:35,623 INFO L93 Difference]: Finished difference Result 58 states and 118 transitions. [2019-12-27 04:44:35,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:44:35,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-27 04:44:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:35,625 INFO L225 Difference]: With dead ends: 58 [2019-12-27 04:44:35,625 INFO L226 Difference]: Without dead ends: 55 [2019-12-27 04:44:35,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=844, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:44:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-27 04:44:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-27 04:44:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-27 04:44:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-27 04:44:35,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 23 [2019-12-27 04:44:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:35,629 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-27 04:44:35,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:44:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-27 04:44:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:44:35,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:35,630 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:35,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:35,833 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 30 times [2019-12-27 04:44:35,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:35,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268047517] [2019-12-27 04:44:35,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:35,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268047517] [2019-12-27 04:44:35,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500946947] [2019-12-27 04:44:35,994 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:36,050 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 04:44:36,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:36,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 04:44:36,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:36,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:36,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 04:44:36,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743793287] [2019-12-27 04:44:36,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:44:36,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:36,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:44:36,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:36,073 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 20 states. [2019-12-27 04:44:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:36,471 INFO L93 Difference]: Finished difference Result 59 states and 120 transitions. [2019-12-27 04:44:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:44:36,471 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-27 04:44:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:36,472 INFO L225 Difference]: With dead ends: 59 [2019-12-27 04:44:36,473 INFO L226 Difference]: Without dead ends: 56 [2019-12-27 04:44:36,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:44:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-27 04:44:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-27 04:44:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-27 04:44:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-27 04:44:36,476 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2019-12-27 04:44:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:36,476 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-27 04:44:36,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:44:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-27 04:44:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:44:36,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:36,477 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:36,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:36,678 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash -501346885, now seen corresponding path program 31 times [2019-12-27 04:44:36,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:36,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855775353] [2019-12-27 04:44:36,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:36,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855775353] [2019-12-27 04:44:36,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312454189] [2019-12-27 04:44:36,886 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:36,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 04:44:36,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:37,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:37,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 04:44:37,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358101717] [2019-12-27 04:44:37,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 04:44:37,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 04:44:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:44:37,013 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 21 states. [2019-12-27 04:44:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:37,512 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-27 04:44:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:44:37,512 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-27 04:44:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:37,513 INFO L225 Difference]: With dead ends: 60 [2019-12-27 04:44:37,513 INFO L226 Difference]: Without dead ends: 57 [2019-12-27 04:44:37,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=442, Invalid=890, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 04:44:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-27 04:44:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-12-27 04:44:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 04:44:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 04:44:37,517 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 24 [2019-12-27 04:44:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:37,518 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 04:44:37,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 04:44:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 04:44:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:44:37,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:37,519 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:37,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:37,722 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash -238048049, now seen corresponding path program 32 times [2019-12-27 04:44:37,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:37,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025340344] [2019-12-27 04:44:37,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:37,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025340344] [2019-12-27 04:44:37,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336583333] [2019-12-27 04:44:37,959 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:38,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:38,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:38,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 04:44:38,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:38,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:38,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 04:44:38,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879075697] [2019-12-27 04:44:38,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 04:44:38,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 04:44:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:44:38,055 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 21 states. [2019-12-27 04:44:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:38,447 INFO L93 Difference]: Finished difference Result 61 states and 124 transitions. [2019-12-27 04:44:38,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:44:38,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-27 04:44:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:38,452 INFO L225 Difference]: With dead ends: 61 [2019-12-27 04:44:38,452 INFO L226 Difference]: Without dead ends: 58 [2019-12-27 04:44:38,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=944, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 04:44:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-27 04:44:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-27 04:44:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-27 04:44:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-27 04:44:38,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 24 [2019-12-27 04:44:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:38,455 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-27 04:44:38,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 04:44:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-27 04:44:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:44:38,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:38,456 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:38,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:38,658 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1638116054, now seen corresponding path program 33 times [2019-12-27 04:44:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396801487] [2019-12-27 04:44:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:38,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396801487] [2019-12-27 04:44:38,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982579241] [2019-12-27 04:44:38,878 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:38,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 04:44:38,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:38,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 04:44:38,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:38,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:38,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 04:44:38,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124505526] [2019-12-27 04:44:38,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 04:44:38,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 04:44:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:44:38,964 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 22 states. [2019-12-27 04:44:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:39,365 INFO L93 Difference]: Finished difference Result 62 states and 126 transitions. [2019-12-27 04:44:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:44:39,367 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-27 04:44:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:39,367 INFO L225 Difference]: With dead ends: 62 [2019-12-27 04:44:39,368 INFO L226 Difference]: Without dead ends: 59 [2019-12-27 04:44:39,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=445, Invalid=1037, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:44:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-27 04:44:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-12-27 04:44:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-27 04:44:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-27 04:44:39,370 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 25 [2019-12-27 04:44:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:39,370 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-27 04:44:39,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 04:44:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-27 04:44:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:44:39,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:39,371 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:39,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:39,575 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1210445130, now seen corresponding path program 34 times [2019-12-27 04:44:39,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:39,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98050747] [2019-12-27 04:44:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:39,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98050747] [2019-12-27 04:44:39,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034860184] [2019-12-27 04:44:39,776 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:39,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:39,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:39,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 04:44:39,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:39,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:39,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 04:44:39,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265314202] [2019-12-27 04:44:39,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 04:44:39,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 04:44:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:44:39,858 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 22 states. [2019-12-27 04:44:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:40,311 INFO L93 Difference]: Finished difference Result 63 states and 128 transitions. [2019-12-27 04:44:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:44:40,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-27 04:44:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:40,313 INFO L225 Difference]: With dead ends: 63 [2019-12-27 04:44:40,313 INFO L226 Difference]: Without dead ends: 60 [2019-12-27 04:44:40,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=527, Invalid=1033, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:44:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-27 04:44:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-27 04:44:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-27 04:44:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2019-12-27 04:44:40,317 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2019-12-27 04:44:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:40,317 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2019-12-27 04:44:40,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 04:44:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2019-12-27 04:44:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:44:40,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:40,318 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:40,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:40,522 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -758009821, now seen corresponding path program 35 times [2019-12-27 04:44:40,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:40,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190202660] [2019-12-27 04:44:40,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:40,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190202660] [2019-12-27 04:44:40,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557791637] [2019-12-27 04:44:40,713 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:40,764 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-27 04:44:40,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:40,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 04:44:40,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:40,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:40,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 04:44:40,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005896758] [2019-12-27 04:44:40,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:44:40,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:44:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:44:40,805 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand 23 states. [2019-12-27 04:44:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:41,304 INFO L93 Difference]: Finished difference Result 64 states and 130 transitions. [2019-12-27 04:44:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:44:41,305 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-27 04:44:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:41,305 INFO L225 Difference]: With dead ends: 64 [2019-12-27 04:44:41,305 INFO L226 Difference]: Without dead ends: 61 [2019-12-27 04:44:41,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=541, Invalid=1099, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:44:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-27 04:44:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-12-27 04:44:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 04:44:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 04:44:41,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 26 [2019-12-27 04:44:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:41,308 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 04:44:41,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:44:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 04:44:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:44:41,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:41,309 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:41,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:41,512 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1130906329, now seen corresponding path program 36 times [2019-12-27 04:44:41,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:41,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394485492] [2019-12-27 04:44:41,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:41,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394485492] [2019-12-27 04:44:41,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101675544] [2019-12-27 04:44:41,716 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:41,771 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-27 04:44:41,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:41,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 04:44:41,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:41,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:41,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 04:44:41,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912730402] [2019-12-27 04:44:41,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:44:41,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:44:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:44:41,804 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 23 states. [2019-12-27 04:44:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:42,230 INFO L93 Difference]: Finished difference Result 65 states and 132 transitions. [2019-12-27 04:44:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 04:44:42,230 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-27 04:44:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:42,231 INFO L225 Difference]: With dead ends: 65 [2019-12-27 04:44:42,232 INFO L226 Difference]: Without dead ends: 62 [2019-12-27 04:44:42,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=526, Invalid=1196, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:44:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-27 04:44:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-27 04:44:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 04:44:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 126 transitions. [2019-12-27 04:44:42,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 126 transitions. Word has length 26 [2019-12-27 04:44:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:42,236 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 126 transitions. [2019-12-27 04:44:42,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:44:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2019-12-27 04:44:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:44:42,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:42,237 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:42,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:42,440 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 37 times [2019-12-27 04:44:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:42,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038656565] [2019-12-27 04:44:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038656565] [2019-12-27 04:44:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576421216] [2019-12-27 04:44:42,660 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:42,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 04:44:42,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:42,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:42,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 04:44:42,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700504747] [2019-12-27 04:44:42,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:44:42,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:44:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:44:42,742 INFO L87 Difference]: Start difference. First operand 62 states and 126 transitions. Second operand 24 states. [2019-12-27 04:44:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:43,236 INFO L93 Difference]: Finished difference Result 66 states and 134 transitions. [2019-12-27 04:44:43,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 04:44:43,237 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-27 04:44:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:43,237 INFO L225 Difference]: With dead ends: 66 [2019-12-27 04:44:43,238 INFO L226 Difference]: Without dead ends: 63 [2019-12-27 04:44:43,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=1274, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:44:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-27 04:44:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-12-27 04:44:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-27 04:44:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2019-12-27 04:44:43,241 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 27 [2019-12-27 04:44:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:43,242 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2019-12-27 04:44:43,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:44:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2019-12-27 04:44:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:44:43,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:43,242 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:43,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:43,443 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash -698357774, now seen corresponding path program 38 times [2019-12-27 04:44:43,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:43,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209482497] [2019-12-27 04:44:43,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:43,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209482497] [2019-12-27 04:44:43,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413192384] [2019-12-27 04:44:43,634 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:43,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:43,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:43,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 04:44:43,687 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:43,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:43,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 04:44:43,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044242984] [2019-12-27 04:44:43,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:44:43,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:44:43,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:44:43,716 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand 24 states. [2019-12-27 04:44:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:44,199 INFO L93 Difference]: Finished difference Result 67 states and 136 transitions. [2019-12-27 04:44:44,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 04:44:44,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-27 04:44:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:44,200 INFO L225 Difference]: With dead ends: 67 [2019-12-27 04:44:44,200 INFO L226 Difference]: Without dead ends: 64 [2019-12-27 04:44:44,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=635, Invalid=1257, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:44:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-27 04:44:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-27 04:44:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-27 04:44:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 130 transitions. [2019-12-27 04:44:44,205 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 130 transitions. Word has length 27 [2019-12-27 04:44:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:44,205 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 130 transitions. [2019-12-27 04:44:44,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:44:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 130 transitions. [2019-12-27 04:44:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 04:44:44,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:44,206 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:44,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:44,409 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1697011851, now seen corresponding path program 39 times [2019-12-27 04:44:44,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:44,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772261841] [2019-12-27 04:44:44,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:44,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772261841] [2019-12-27 04:44:44,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748786578] [2019-12-27 04:44:44,624 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:44,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-27 04:44:44,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:44,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 04:44:44,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:44,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:44,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 04:44:44,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936756966] [2019-12-27 04:44:44,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 04:44:44,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 04:44:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:44:44,716 INFO L87 Difference]: Start difference. First operand 64 states and 130 transitions. Second operand 25 states. [2019-12-27 04:44:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:45,257 INFO L93 Difference]: Finished difference Result 68 states and 138 transitions. [2019-12-27 04:44:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 04:44:45,258 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-12-27 04:44:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:45,259 INFO L225 Difference]: With dead ends: 68 [2019-12-27 04:44:45,259 INFO L226 Difference]: Without dead ends: 65 [2019-12-27 04:44:45,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=650, Invalid=1330, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 04:44:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-27 04:44:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-12-27 04:44:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 04:44:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 04:44:45,262 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 28 [2019-12-27 04:44:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:45,262 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 04:44:45,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 04:44:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 04:44:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 04:44:45,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:45,264 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:45,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:45,465 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash -174254209, now seen corresponding path program 40 times [2019-12-27 04:44:45,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:45,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156305628] [2019-12-27 04:44:45,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:45,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156305628] [2019-12-27 04:44:45,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982398887] [2019-12-27 04:44:45,677 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:45,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:45,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:45,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 04:44:45,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:45,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:45,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 04:44:45,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465293891] [2019-12-27 04:44:45,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 04:44:45,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 04:44:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:44:45,755 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 25 states. [2019-12-27 04:44:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:46,318 INFO L93 Difference]: Finished difference Result 69 states and 140 transitions. [2019-12-27 04:44:46,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:44:46,318 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-12-27 04:44:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:46,319 INFO L225 Difference]: With dead ends: 69 [2019-12-27 04:44:46,319 INFO L226 Difference]: Without dead ends: 66 [2019-12-27 04:44:46,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=674, Invalid=1396, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 04:44:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-27 04:44:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-27 04:44:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-27 04:44:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2019-12-27 04:44:46,321 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 28 [2019-12-27 04:44:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:46,322 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2019-12-27 04:44:46,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 04:44:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2019-12-27 04:44:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 04:44:46,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:46,322 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:46,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:46,525 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1067760134, now seen corresponding path program 41 times [2019-12-27 04:44:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:46,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212590207] [2019-12-27 04:44:46,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:46,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212590207] [2019-12-27 04:44:46,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526178151] [2019-12-27 04:44:46,771 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:46,833 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-12-27 04:44:46,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:46,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 04:44:46,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:46,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:46,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 04:44:46,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758726223] [2019-12-27 04:44:46,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 04:44:46,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 04:44:46,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:44:46,864 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand 26 states. [2019-12-27 04:44:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:47,475 INFO L93 Difference]: Finished difference Result 70 states and 142 transitions. [2019-12-27 04:44:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:44:47,476 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-27 04:44:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:47,476 INFO L225 Difference]: With dead ends: 70 [2019-12-27 04:44:47,476 INFO L226 Difference]: Without dead ends: 67 [2019-12-27 04:44:47,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=734, Invalid=1522, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 04:44:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-27 04:44:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 41. [2019-12-27 04:44:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-27 04:44:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 84 transitions. [2019-12-27 04:44:47,479 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 84 transitions. Word has length 29 [2019-12-27 04:44:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:47,480 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 84 transitions. [2019-12-27 04:44:47,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 04:44:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 84 transitions. [2019-12-27 04:44:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 04:44:47,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:47,481 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:47,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:47,684 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:47,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1106913126, now seen corresponding path program 42 times [2019-12-27 04:44:47,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:47,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085226600] [2019-12-27 04:44:47,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:47,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085226600] [2019-12-27 04:44:47,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125122985] [2019-12-27 04:44:47,959 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:48,031 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-12-27 04:44:48,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:48,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 04:44:48,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:48,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:48,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 04:44:48,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710039802] [2019-12-27 04:44:48,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 04:44:48,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:48,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 04:44:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:44:48,059 INFO L87 Difference]: Start difference. First operand 41 states and 84 transitions. Second operand 26 states. [2019-12-27 04:44:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:48,754 INFO L93 Difference]: Finished difference Result 71 states and 144 transitions. [2019-12-27 04:44:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:44:48,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-27 04:44:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:48,755 INFO L225 Difference]: With dead ends: 71 [2019-12-27 04:44:48,755 INFO L226 Difference]: Without dead ends: 68 [2019-12-27 04:44:48,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=753, Invalid=1503, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 04:44:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-27 04:44:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-27 04:44:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-27 04:44:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 138 transitions. [2019-12-27 04:44:48,759 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 138 transitions. Word has length 29 [2019-12-27 04:44:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:48,759 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 138 transitions. [2019-12-27 04:44:48,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 04:44:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 138 transitions. [2019-12-27 04:44:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:44:48,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:48,761 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:48,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:48,965 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:48,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1259174157, now seen corresponding path program 43 times [2019-12-27 04:44:48,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:48,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760339142] [2019-12-27 04:44:48,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:49,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760339142] [2019-12-27 04:44:49,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948668413] [2019-12-27 04:44:49,200 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:49,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 04:44:49,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:49,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:49,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 04:44:49,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699630544] [2019-12-27 04:44:49,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 04:44:49,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 04:44:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:44:49,297 INFO L87 Difference]: Start difference. First operand 68 states and 138 transitions. Second operand 27 states. [2019-12-27 04:44:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:49,937 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2019-12-27 04:44:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:44:49,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-27 04:44:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:49,938 INFO L225 Difference]: With dead ends: 72 [2019-12-27 04:44:49,939 INFO L226 Difference]: Without dead ends: 69 [2019-12-27 04:44:49,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=769, Invalid=1583, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 04:44:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-27 04:44:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-12-27 04:44:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 04:44:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 04:44:49,942 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 30 [2019-12-27 04:44:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:49,942 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 04:44:49,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 04:44:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 04:44:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:44:49,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:49,943 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:50,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:50,146 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash 45431767, now seen corresponding path program 44 times [2019-12-27 04:44:50,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:50,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096688775] [2019-12-27 04:44:50,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:50,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096688775] [2019-12-27 04:44:50,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874145489] [2019-12-27 04:44:50,401 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:50,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:50,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:50,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 04:44:50,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:50,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:50,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 04:44:50,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313939581] [2019-12-27 04:44:50,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 04:44:50,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 04:44:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:44:50,505 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 27 states. [2019-12-27 04:44:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:51,086 INFO L93 Difference]: Finished difference Result 73 states and 148 transitions. [2019-12-27 04:44:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 04:44:51,086 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-27 04:44:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:51,087 INFO L225 Difference]: With dead ends: 73 [2019-12-27 04:44:51,087 INFO L226 Difference]: Without dead ends: 70 [2019-12-27 04:44:51,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=795, Invalid=1655, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 04:44:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-27 04:44:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-27 04:44:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-27 04:44:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2019-12-27 04:44:51,091 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 142 transitions. Word has length 30 [2019-12-27 04:44:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:51,091 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 142 transitions. [2019-12-27 04:44:51,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 04:44:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2019-12-27 04:44:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:44:51,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:51,092 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:51,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:51,295 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -379692898, now seen corresponding path program 45 times [2019-12-27 04:44:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:51,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036938759] [2019-12-27 04:44:51,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:51,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036938759] [2019-12-27 04:44:51,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369778728] [2019-12-27 04:44:51,537 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:51,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-27 04:44:51,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:51,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-27 04:44:51,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:51,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:51,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 04:44:51,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502709263] [2019-12-27 04:44:51,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 04:44:51,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:51,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 04:44:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:44:51,631 INFO L87 Difference]: Start difference. First operand 70 states and 142 transitions. Second operand 28 states. [2019-12-27 04:44:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:52,218 INFO L93 Difference]: Finished difference Result 74 states and 150 transitions. [2019-12-27 04:44:52,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 04:44:52,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-12-27 04:44:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:52,220 INFO L225 Difference]: With dead ends: 74 [2019-12-27 04:44:52,220 INFO L226 Difference]: Without dead ends: 71 [2019-12-27 04:44:52,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=754, Invalid=1796, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 04:44:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-27 04:44:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2019-12-27 04:44:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-27 04:44:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 88 transitions. [2019-12-27 04:44:52,224 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 88 transitions. Word has length 31 [2019-12-27 04:44:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:52,224 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 88 transitions. [2019-12-27 04:44:52,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 04:44:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 88 transitions. [2019-12-27 04:44:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:44:52,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:52,225 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:52,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:52,426 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1408384834, now seen corresponding path program 46 times [2019-12-27 04:44:52,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:52,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665666558] [2019-12-27 04:44:52,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:52,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665666558] [2019-12-27 04:44:52,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593194771] [2019-12-27 04:44:52,696 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:52,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:52,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:52,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 04:44:52,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:52,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:52,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 04:44:52,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139868101] [2019-12-27 04:44:52,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 04:44:52,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 04:44:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:44:52,781 INFO L87 Difference]: Start difference. First operand 43 states and 88 transitions. Second operand 28 states. [2019-12-27 04:44:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:53,432 INFO L93 Difference]: Finished difference Result 75 states and 152 transitions. [2019-12-27 04:44:53,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:44:53,438 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-12-27 04:44:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:53,439 INFO L225 Difference]: With dead ends: 75 [2019-12-27 04:44:53,439 INFO L226 Difference]: Without dead ends: 72 [2019-12-27 04:44:53,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=881, Invalid=1771, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 04:44:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-27 04:44:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-27 04:44:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-27 04:44:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2019-12-27 04:44:53,442 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 31 [2019-12-27 04:44:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:53,443 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2019-12-27 04:44:53,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 04:44:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2019-12-27 04:44:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 04:44:53,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:53,443 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:53,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:53,644 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1114422107, now seen corresponding path program 47 times [2019-12-27 04:44:53,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:53,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887498515] [2019-12-27 04:44:53,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:53,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887498515] [2019-12-27 04:44:53,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668482069] [2019-12-27 04:44:53,921 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:53,983 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-27 04:44:53,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:53,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-27 04:44:53,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:54,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:54,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 04:44:54,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850907543] [2019-12-27 04:44:54,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 04:44:54,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 04:44:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:44:54,008 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand 29 states. [2019-12-27 04:44:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:54,689 INFO L93 Difference]: Finished difference Result 76 states and 154 transitions. [2019-12-27 04:44:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:44:54,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-12-27 04:44:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:54,691 INFO L225 Difference]: With dead ends: 76 [2019-12-27 04:44:54,691 INFO L226 Difference]: Without dead ends: 73 [2019-12-27 04:44:54,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=898, Invalid=1858, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 04:44:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-27 04:44:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-12-27 04:44:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 04:44:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 04:44:54,694 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 32 [2019-12-27 04:44:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:54,694 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 04:44:54,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 04:44:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 04:44:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 04:44:54,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:54,695 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:54,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:54,895 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 710257199, now seen corresponding path program 48 times [2019-12-27 04:44:54,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:54,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900454792] [2019-12-27 04:44:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:55,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900454792] [2019-12-27 04:44:55,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523494708] [2019-12-27 04:44:55,153 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:55,218 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-27 04:44:55,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:55,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 04:44:55,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:55,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:55,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 04:44:55,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948244511] [2019-12-27 04:44:55,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 04:44:55,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 04:44:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:44:55,243 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 29 states. [2019-12-27 04:44:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:55,883 INFO L93 Difference]: Finished difference Result 77 states and 156 transitions. [2019-12-27 04:44:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:44:55,883 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-12-27 04:44:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:55,884 INFO L225 Difference]: With dead ends: 77 [2019-12-27 04:44:55,885 INFO L226 Difference]: Without dead ends: 74 [2019-12-27 04:44:55,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=859, Invalid=2003, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 04:44:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-27 04:44:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-27 04:44:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-27 04:44:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 150 transitions. [2019-12-27 04:44:55,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 150 transitions. Word has length 32 [2019-12-27 04:44:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:55,888 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 150 transitions. [2019-12-27 04:44:55,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 04:44:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 150 transitions. [2019-12-27 04:44:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 04:44:55,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:55,889 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:56,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:56,092 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 187347254, now seen corresponding path program 49 times [2019-12-27 04:44:56,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:56,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976729752] [2019-12-27 04:44:56,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:56,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976729752] [2019-12-27 04:44:56,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542435159] [2019-12-27 04:44:56,401 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:56,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 04:44:56,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:56,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:56,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 04:44:56,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931699506] [2019-12-27 04:44:56,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 04:44:56,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 04:44:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:44:56,482 INFO L87 Difference]: Start difference. First operand 74 states and 150 transitions. Second operand 30 states. [2019-12-27 04:44:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:57,230 INFO L93 Difference]: Finished difference Result 78 states and 158 transitions. [2019-12-27 04:44:57,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:44:57,230 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-27 04:44:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:57,232 INFO L225 Difference]: With dead ends: 78 [2019-12-27 04:44:57,232 INFO L226 Difference]: Without dead ends: 75 [2019-12-27 04:44:57,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=996, Invalid=2084, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 04:44:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-27 04:44:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2019-12-27 04:44:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-27 04:44:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2019-12-27 04:44:57,235 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 92 transitions. Word has length 33 [2019-12-27 04:44:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:57,235 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 92 transitions. [2019-12-27 04:44:57,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 04:44:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 92 transitions. [2019-12-27 04:44:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 04:44:57,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:57,236 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:57,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:57,439 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 543136746, now seen corresponding path program 50 times [2019-12-27 04:44:57,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:57,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213833374] [2019-12-27 04:44:57,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:57,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213833374] [2019-12-27 04:44:57,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259446383] [2019-12-27 04:44:57,835 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:57,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:57,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:57,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 04:44:57,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:57,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:57,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 04:44:57,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508018798] [2019-12-27 04:44:57,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 04:44:57,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 04:44:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:44:57,928 INFO L87 Difference]: Start difference. First operand 45 states and 92 transitions. Second operand 30 states. [2019-12-27 04:44:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:58,623 INFO L93 Difference]: Finished difference Result 79 states and 160 transitions. [2019-12-27 04:44:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:44:58,624 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-27 04:44:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:58,625 INFO L225 Difference]: With dead ends: 79 [2019-12-27 04:44:58,625 INFO L226 Difference]: Without dead ends: 76 [2019-12-27 04:44:58,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1019, Invalid=2061, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 04:44:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-27 04:44:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-27 04:44:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-27 04:44:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-27 04:44:58,629 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 33 [2019-12-27 04:44:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:58,629 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-27 04:44:58,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 04:44:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-27 04:44:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 04:44:58,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:58,630 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:58,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:58,834 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1512797635, now seen corresponding path program 51 times [2019-12-27 04:44:58,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359204757] [2019-12-27 04:44:58,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:59,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359204757] [2019-12-27 04:44:59,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799706597] [2019-12-27 04:44:59,133 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:59,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-27 04:44:59,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:59,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 04:44:59,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:59,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:59,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 04:44:59,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461916936] [2019-12-27 04:44:59,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 04:44:59,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 04:44:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-27 04:44:59,232 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 31 states. [2019-12-27 04:44:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:59,999 INFO L93 Difference]: Finished difference Result 80 states and 162 transitions. [2019-12-27 04:45:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:45:00,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-12-27 04:45:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:00,000 INFO L225 Difference]: With dead ends: 80 [2019-12-27 04:45:00,001 INFO L226 Difference]: Without dead ends: 77 [2019-12-27 04:45:00,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1037, Invalid=2155, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 04:45:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-27 04:45:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2019-12-27 04:45:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-27 04:45:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-27 04:45:00,003 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 34 [2019-12-27 04:45:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:00,003 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-27 04:45:00,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 04:45:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-27 04:45:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 04:45:00,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:00,004 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:00,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:00,208 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash -342629753, now seen corresponding path program 52 times [2019-12-27 04:45:00,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:00,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260105857] [2019-12-27 04:45:00,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:00,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260105857] [2019-12-27 04:45:00,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544140430] [2019-12-27 04:45:00,586 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:00,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:45:00,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:00,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 04:45:00,642 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:00,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:00,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 04:45:00,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965768756] [2019-12-27 04:45:00,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 04:45:00,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:00,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 04:45:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-27 04:45:00,674 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 31 states. [2019-12-27 04:45:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:01,403 INFO L93 Difference]: Finished difference Result 81 states and 164 transitions. [2019-12-27 04:45:01,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:45:01,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-12-27 04:45:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:01,404 INFO L225 Difference]: With dead ends: 81 [2019-12-27 04:45:01,405 INFO L226 Difference]: Without dead ends: 78 [2019-12-27 04:45:01,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1067, Invalid=2239, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 04:45:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-27 04:45:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-27 04:45:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-27 04:45:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2019-12-27 04:45:01,409 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 34 [2019-12-27 04:45:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:01,409 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 158 transitions. [2019-12-27 04:45:01,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 04:45:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 158 transitions. [2019-12-27 04:45:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 04:45:01,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:01,410 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:01,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:01,613 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash -347913266, now seen corresponding path program 53 times [2019-12-27 04:45:01,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:01,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793533567] [2019-12-27 04:45:01,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:01,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793533567] [2019-12-27 04:45:01,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407120184] [2019-12-27 04:45:01,979 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:02,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-12-27 04:45:02,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:02,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 04:45:02,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:02,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:02,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 04:45:02,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933590176] [2019-12-27 04:45:02,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 04:45:02,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 04:45:02,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:45:02,065 INFO L87 Difference]: Start difference. First operand 78 states and 158 transitions. Second operand 32 states. [2019-12-27 04:45:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:02,874 INFO L93 Difference]: Finished difference Result 82 states and 166 transitions. [2019-12-27 04:45:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 04:45:02,875 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-12-27 04:45:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:02,876 INFO L225 Difference]: With dead ends: 82 [2019-12-27 04:45:02,876 INFO L226 Difference]: Without dead ends: 79 [2019-12-27 04:45:02,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1142, Invalid=2398, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 04:45:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-27 04:45:02,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2019-12-27 04:45:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-27 04:45:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 96 transitions. [2019-12-27 04:45:02,879 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 96 transitions. Word has length 35 [2019-12-27 04:45:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:02,879 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 96 transitions. [2019-12-27 04:45:02,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 04:45:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 96 transitions. [2019-12-27 04:45:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 04:45:02,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:02,880 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:03,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:03,083 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2031587694, now seen corresponding path program 54 times [2019-12-27 04:45:03,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:03,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656708415] [2019-12-27 04:45:03,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:03,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656708415] [2019-12-27 04:45:03,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635234398] [2019-12-27 04:45:03,621 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:03,733 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-12-27 04:45:03,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:03,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 04:45:03,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:03,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:03,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 04:45:03,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729755064] [2019-12-27 04:45:03,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 04:45:03,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 04:45:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:45:03,784 INFO L87 Difference]: Start difference. First operand 47 states and 96 transitions. Second operand 32 states. [2019-12-27 04:45:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:04,785 INFO L93 Difference]: Finished difference Result 83 states and 168 transitions. [2019-12-27 04:45:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 04:45:04,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-12-27 04:45:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:04,786 INFO L225 Difference]: With dead ends: 83 [2019-12-27 04:45:04,787 INFO L226 Difference]: Without dead ends: 80 [2019-12-27 04:45:04,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1167, Invalid=2373, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 04:45:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-27 04:45:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-27 04:45:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-27 04:45:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 162 transitions. [2019-12-27 04:45:04,790 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 162 transitions. Word has length 35 [2019-12-27 04:45:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:04,791 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 162 transitions. [2019-12-27 04:45:04,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 04:45:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 162 transitions. [2019-12-27 04:45:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 04:45:04,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:04,792 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:04,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:04,996 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2099590699, now seen corresponding path program 55 times [2019-12-27 04:45:04,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:04,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931551425] [2019-12-27 04:45:04,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:05,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931551425] [2019-12-27 04:45:05,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446084729] [2019-12-27 04:45:05,349 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:05,411 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-27 04:45:05,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:05,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:05,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 04:45:05,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166673562] [2019-12-27 04:45:05,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 04:45:05,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 04:45:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:45:05,436 INFO L87 Difference]: Start difference. First operand 80 states and 162 transitions. Second operand 33 states. [2019-12-27 04:45:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:06,258 INFO L93 Difference]: Finished difference Result 84 states and 170 transitions. [2019-12-27 04:45:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 04:45:06,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-12-27 04:45:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:06,260 INFO L225 Difference]: With dead ends: 84 [2019-12-27 04:45:06,260 INFO L226 Difference]: Without dead ends: 81 [2019-12-27 04:45:06,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1186, Invalid=2474, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 04:45:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-27 04:45:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2019-12-27 04:45:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-27 04:45:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-27 04:45:06,263 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 36 [2019-12-27 04:45:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:06,264 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-27 04:45:06,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 04:45:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-27 04:45:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 04:45:06,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:06,264 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:06,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:06,467 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1445291231, now seen corresponding path program 56 times [2019-12-27 04:45:06,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:06,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382561484] [2019-12-27 04:45:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:06,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382561484] [2019-12-27 04:45:06,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265878513] [2019-12-27 04:45:06,813 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:06,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:45:06,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:06,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 04:45:06,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:06,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:06,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 04:45:06,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52157845] [2019-12-27 04:45:06,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 04:45:06,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 04:45:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:45:06,894 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 33 states. [2019-12-27 04:45:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:07,653 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2019-12-27 04:45:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:45:07,653 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-12-27 04:45:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:07,654 INFO L225 Difference]: With dead ends: 85 [2019-12-27 04:45:07,655 INFO L226 Difference]: Without dead ends: 82 [2019-12-27 04:45:07,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1126, Invalid=2656, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 04:45:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-27 04:45:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-27 04:45:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-27 04:45:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 166 transitions. [2019-12-27 04:45:07,659 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 166 transitions. Word has length 36 [2019-12-27 04:45:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:07,659 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 166 transitions. [2019-12-27 04:45:07,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 04:45:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 166 transitions. [2019-12-27 04:45:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 04:45:07,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:07,660 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:07,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:07,863 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 662802534, now seen corresponding path program 57 times [2019-12-27 04:45:07,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:07,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173503096] [2019-12-27 04:45:07,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:08,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173503096] [2019-12-27 04:45:08,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353156791] [2019-12-27 04:45:08,341 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:08,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-27 04:45:08,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:08,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 04:45:08,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:08,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:08,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 04:45:08,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856454211] [2019-12-27 04:45:08,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 04:45:08,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 04:45:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 04:45:08,477 INFO L87 Difference]: Start difference. First operand 82 states and 166 transitions. Second operand 34 states. [2019-12-27 04:45:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:09,336 INFO L93 Difference]: Finished difference Result 86 states and 174 transitions. [2019-12-27 04:45:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:45:09,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-12-27 04:45:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:09,338 INFO L225 Difference]: With dead ends: 86 [2019-12-27 04:45:09,338 INFO L226 Difference]: Without dead ends: 83 [2019-12-27 04:45:09,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1298, Invalid=2734, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 04:45:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-27 04:45:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2019-12-27 04:45:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-27 04:45:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2019-12-27 04:45:09,341 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 100 transitions. Word has length 37 [2019-12-27 04:45:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:09,342 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 100 transitions. [2019-12-27 04:45:09,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 04:45:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 100 transitions. [2019-12-27 04:45:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 04:45:09,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:09,342 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:09,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:09,545 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1854355258, now seen corresponding path program 58 times [2019-12-27 04:45:09,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:09,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032674012] [2019-12-27 04:45:09,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:09,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032674012] [2019-12-27 04:45:09,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072051040] [2019-12-27 04:45:09,896 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:09,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:45:09,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:09,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 04:45:09,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:10,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:10,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 04:45:10,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593479834] [2019-12-27 04:45:10,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 04:45:10,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 04:45:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 04:45:10,010 INFO L87 Difference]: Start difference. First operand 49 states and 100 transitions. Second operand 34 states. [2019-12-27 04:45:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:10,865 INFO L93 Difference]: Finished difference Result 87 states and 176 transitions. [2019-12-27 04:45:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:45:10,865 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-12-27 04:45:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:10,866 INFO L225 Difference]: With dead ends: 87 [2019-12-27 04:45:10,866 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 04:45:10,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1325, Invalid=2707, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 04:45:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 04:45:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-27 04:45:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 04:45:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 170 transitions. [2019-12-27 04:45:10,871 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 170 transitions. Word has length 37 [2019-12-27 04:45:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:10,871 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 170 transitions. [2019-12-27 04:45:10,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 04:45:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 170 transitions. [2019-12-27 04:45:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 04:45:10,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:10,872 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:11,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:11,075 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash -927957869, now seen corresponding path program 59 times [2019-12-27 04:45:11,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:11,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591862361] [2019-12-27 04:45:11,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:11,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591862361] [2019-12-27 04:45:11,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449628148] [2019-12-27 04:45:11,442 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:11,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-12-27 04:45:11,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:11,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-27 04:45:11,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:11,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:11,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 04:45:11,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519922212] [2019-12-27 04:45:11,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 04:45:11,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:11,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 04:45:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 04:45:11,568 INFO L87 Difference]: Start difference. First operand 84 states and 170 transitions. Second operand 35 states. [2019-12-27 04:45:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:12,481 INFO L93 Difference]: Finished difference Result 88 states and 178 transitions. [2019-12-27 04:45:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:45:12,481 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-12-27 04:45:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:12,482 INFO L225 Difference]: With dead ends: 88 [2019-12-27 04:45:12,483 INFO L226 Difference]: Without dead ends: 85 [2019-12-27 04:45:12,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1345, Invalid=2815, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 04:45:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-27 04:45:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-12-27 04:45:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-27 04:45:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-27 04:45:12,485 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 38 [2019-12-27 04:45:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:12,486 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-27 04:45:12,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 04:45:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-27 04:45:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 04:45:12,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:12,487 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:12,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:12,690 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1650438455, now seen corresponding path program 60 times [2019-12-27 04:45:12,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:12,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163783457] [2019-12-27 04:45:12,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:13,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163783457] [2019-12-27 04:45:13,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842574832] [2019-12-27 04:45:13,078 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:13,152 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-12-27 04:45:13,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:13,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 04:45:13,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:13,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:13,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 04:45:13,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112856391] [2019-12-27 04:45:13,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 04:45:13,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 04:45:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 04:45:13,179 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 35 states. [2019-12-27 04:45:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:14,025 INFO L93 Difference]: Finished difference Result 89 states and 180 transitions. [2019-12-27 04:45:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 04:45:14,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-12-27 04:45:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:14,026 INFO L225 Difference]: With dead ends: 89 [2019-12-27 04:45:14,027 INFO L226 Difference]: Without dead ends: 86 [2019-12-27 04:45:14,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1273, Invalid=3017, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 04:45:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-27 04:45:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-27 04:45:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 04:45:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 174 transitions. [2019-12-27 04:45:14,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 174 transitions. Word has length 38 [2019-12-27 04:45:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:14,030 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 174 transitions. [2019-12-27 04:45:14,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 04:45:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 174 transitions. [2019-12-27 04:45:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 04:45:14,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:14,031 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:14,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:14,235 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1298077438, now seen corresponding path program 61 times [2019-12-27 04:45:14,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:14,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930345374] [2019-12-27 04:45:14,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:14,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930345374] [2019-12-27 04:45:14,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445742147] [2019-12-27 04:45:14,652 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:14,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 04:45:14,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:14,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:14,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 04:45:14,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417765369] [2019-12-27 04:45:14,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 04:45:14,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 04:45:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:45:14,748 INFO L87 Difference]: Start difference. First operand 86 states and 174 transitions. Second operand 36 states. [2019-12-27 04:45:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:15,733 INFO L93 Difference]: Finished difference Result 90 states and 182 transitions. [2019-12-27 04:45:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:45:15,733 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-12-27 04:45:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:15,734 INFO L225 Difference]: With dead ends: 90 [2019-12-27 04:45:15,734 INFO L226 Difference]: Without dead ends: 87 [2019-12-27 04:45:15,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1464, Invalid=3092, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 04:45:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-27 04:45:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2019-12-27 04:45:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-27 04:45:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2019-12-27 04:45:15,738 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 104 transitions. Word has length 39 [2019-12-27 04:45:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:15,738 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 104 transitions. [2019-12-27 04:45:15,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 04:45:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2019-12-27 04:45:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 04:45:15,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:15,738 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:15,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:15,939 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:15,940 INFO L82 PathProgramCache]: Analyzing trace with hash -376015390, now seen corresponding path program 62 times [2019-12-27 04:45:15,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:15,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768275100] [2019-12-27 04:45:15,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:16,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768275100] [2019-12-27 04:45:16,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352160244] [2019-12-27 04:45:16,317 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:16,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:45:16,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:16,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 04:45:16,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:16,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:16,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 04:45:16,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031694018] [2019-12-27 04:45:16,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 04:45:16,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 04:45:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:45:16,441 INFO L87 Difference]: Start difference. First operand 51 states and 104 transitions. Second operand 36 states. [2019-12-27 04:45:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:17,420 INFO L93 Difference]: Finished difference Result 91 states and 184 transitions. [2019-12-27 04:45:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:45:17,421 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-12-27 04:45:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:17,422 INFO L225 Difference]: With dead ends: 91 [2019-12-27 04:45:17,422 INFO L226 Difference]: Without dead ends: 88 [2019-12-27 04:45:17,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1493, Invalid=3063, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 04:45:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-27 04:45:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-27 04:45:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-27 04:45:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 178 transitions. [2019-12-27 04:45:17,426 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 178 transitions. Word has length 39 [2019-12-27 04:45:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:17,426 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 178 transitions. [2019-12-27 04:45:17,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 04:45:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 178 transitions. [2019-12-27 04:45:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:45:17,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:17,427 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:17,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:17,631 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:17,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1585694971, now seen corresponding path program 63 times [2019-12-27 04:45:17,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:17,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853477821] [2019-12-27 04:45:17,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:18,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853477821] [2019-12-27 04:45:18,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089868498] [2019-12-27 04:45:18,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:18,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-12-27 04:45:18,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:18,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 04:45:18,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:18,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:18,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 04:45:18,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578565474] [2019-12-27 04:45:18,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 04:45:18,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 04:45:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 04:45:18,642 INFO L87 Difference]: Start difference. First operand 88 states and 178 transitions. Second operand 37 states. [2019-12-27 04:45:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:19,624 INFO L93 Difference]: Finished difference Result 92 states and 186 transitions. [2019-12-27 04:45:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:45:19,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-12-27 04:45:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:19,625 INFO L225 Difference]: With dead ends: 92 [2019-12-27 04:45:19,625 INFO L226 Difference]: Without dead ends: 89 [2019-12-27 04:45:19,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1514, Invalid=3178, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 04:45:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-27 04:45:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2019-12-27 04:45:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-27 04:45:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-27 04:45:19,628 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 40 [2019-12-27 04:45:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:19,629 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-27 04:45:19,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 04:45:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-27 04:45:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:45:19,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:19,629 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:19,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:19,830 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1228425103, now seen corresponding path program 64 times [2019-12-27 04:45:19,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:19,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370535826] [2019-12-27 04:45:19,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:20,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370535826] [2019-12-27 04:45:20,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572372661] [2019-12-27 04:45:20,231 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:20,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:45:20,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:20,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 04:45:20,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:20,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:20,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 04:45:20,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920331226] [2019-12-27 04:45:20,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 04:45:20,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:20,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 04:45:20,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 04:45:20,336 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 37 states. [2019-12-27 04:45:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:21,343 INFO L93 Difference]: Finished difference Result 93 states and 188 transitions. [2019-12-27 04:45:21,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 04:45:21,343 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-12-27 04:45:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:21,344 INFO L225 Difference]: With dead ends: 93 [2019-12-27 04:45:21,344 INFO L226 Difference]: Without dead ends: 90 [2019-12-27 04:45:21,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1550, Invalid=3280, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 04:45:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-27 04:45:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-27 04:45:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-27 04:45:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2019-12-27 04:45:21,350 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 40 [2019-12-27 04:45:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:21,351 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 182 transitions. [2019-12-27 04:45:21,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 04:45:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 182 transitions. [2019-12-27 04:45:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:45:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:21,352 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:21,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:21,555 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1911904150, now seen corresponding path program 65 times [2019-12-27 04:45:21,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:21,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598632537] [2019-12-27 04:45:21,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:22,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598632537] [2019-12-27 04:45:22,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191514365] [2019-12-27 04:45:22,263 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:22,382 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-12-27 04:45:22,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:22,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 04:45:22,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:22,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:22,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 04:45:22,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073379306] [2019-12-27 04:45:22,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 04:45:22,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:22,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 04:45:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 04:45:22,431 INFO L87 Difference]: Start difference. First operand 90 states and 182 transitions. Second operand 38 states. [2019-12-27 04:45:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:23,833 INFO L93 Difference]: Finished difference Result 94 states and 190 transitions. [2019-12-27 04:45:23,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 04:45:23,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2019-12-27 04:45:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:23,834 INFO L225 Difference]: With dead ends: 94 [2019-12-27 04:45:23,834 INFO L226 Difference]: Without dead ends: 91 [2019-12-27 04:45:23,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1640, Invalid=3472, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 04:45:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-27 04:45:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2019-12-27 04:45:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-27 04:45:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 108 transitions. [2019-12-27 04:45:23,838 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 108 transitions. Word has length 41 [2019-12-27 04:45:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:23,838 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 108 transitions. [2019-12-27 04:45:23,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 04:45:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 108 transitions. [2019-12-27 04:45:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:45:23,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:23,839 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:24,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:24,040 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:24,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:24,040 INFO L82 PathProgramCache]: Analyzing trace with hash -573527414, now seen corresponding path program 66 times [2019-12-27 04:45:24,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:24,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173639879] [2019-12-27 04:45:24,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:24,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173639879] [2019-12-27 04:45:24,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646785176] [2019-12-27 04:45:24,450 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:24,526 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-27 04:45:24,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:24,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 04:45:24,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:24,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:24,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 04:45:24,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24444252] [2019-12-27 04:45:24,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 04:45:24,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 04:45:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 04:45:24,559 INFO L87 Difference]: Start difference. First operand 53 states and 108 transitions. Second operand 38 states. [2019-12-27 04:45:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:25,639 INFO L93 Difference]: Finished difference Result 95 states and 192 transitions. [2019-12-27 04:45:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 04:45:25,639 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2019-12-27 04:45:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:25,640 INFO L225 Difference]: With dead ends: 95 [2019-12-27 04:45:25,640 INFO L226 Difference]: Without dead ends: 92 [2019-12-27 04:45:25,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1671, Invalid=3441, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 04:45:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-27 04:45:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-27 04:45:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-27 04:45:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 186 transitions. [2019-12-27 04:45:25,644 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 186 transitions. Word has length 41 [2019-12-27 04:45:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:25,644 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 186 transitions. [2019-12-27 04:45:25,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 04:45:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 186 transitions. [2019-12-27 04:45:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:45:25,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:25,645 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:25,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:25,848 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash -860513437, now seen corresponding path program 67 times [2019-12-27 04:45:25,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:25,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860832601] [2019-12-27 04:45:25,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:26,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860832601] [2019-12-27 04:45:26,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433280596] [2019-12-27 04:45:26,454 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:26,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-27 04:45:26,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:26,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:26,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 04:45:26,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265323740] [2019-12-27 04:45:26,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 04:45:26,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 04:45:26,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:45:26,557 INFO L87 Difference]: Start difference. First operand 92 states and 186 transitions. Second operand 39 states. [2019-12-27 04:45:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:27,633 INFO L93 Difference]: Finished difference Result 96 states and 194 transitions. [2019-12-27 04:45:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 04:45:27,633 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-12-27 04:45:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:27,634 INFO L225 Difference]: With dead ends: 96 [2019-12-27 04:45:27,634 INFO L226 Difference]: Without dead ends: 93 [2019-12-27 04:45:27,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1693, Invalid=3563, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 04:45:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-27 04:45:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-12-27 04:45:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-27 04:45:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-27 04:45:27,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 42 [2019-12-27 04:45:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:27,638 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-27 04:45:27,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 04:45:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-27 04:45:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:45:27,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:27,639 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:27,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:27,842 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash -599480345, now seen corresponding path program 68 times [2019-12-27 04:45:27,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:27,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946498087] [2019-12-27 04:45:27,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:28,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946498087] [2019-12-27 04:45:28,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341602210] [2019-12-27 04:45:28,301 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:28,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:45:28,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:28,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 04:45:28,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:28,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:28,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 04:45:28,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790139373] [2019-12-27 04:45:28,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 04:45:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 04:45:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:45:28,393 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 39 states. [2019-12-27 04:45:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:29,397 INFO L93 Difference]: Finished difference Result 97 states and 196 transitions. [2019-12-27 04:45:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 04:45:29,398 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-12-27 04:45:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:29,399 INFO L225 Difference]: With dead ends: 97 [2019-12-27 04:45:29,399 INFO L226 Difference]: Without dead ends: 94 [2019-12-27 04:45:29,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1594, Invalid=3808, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 04:45:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-27 04:45:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-27 04:45:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-27 04:45:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 190 transitions. [2019-12-27 04:45:29,402 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 190 transitions. Word has length 42 [2019-12-27 04:45:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:29,403 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 190 transitions. [2019-12-27 04:45:29,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 04:45:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 190 transitions. [2019-12-27 04:45:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 04:45:29,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:29,403 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:29,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:29,607 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash -906112466, now seen corresponding path program 69 times [2019-12-27 04:45:29,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:29,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709942662] [2019-12-27 04:45:29,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:30,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709942662] [2019-12-27 04:45:30,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988026182] [2019-12-27 04:45:30,077 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:30,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-27 04:45:30,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:30,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 04:45:30,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:30,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:30,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 04:45:30,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868345787] [2019-12-27 04:45:30,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 04:45:30,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 04:45:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:45:30,207 INFO L87 Difference]: Start difference. First operand 94 states and 190 transitions. Second operand 40 states. [2019-12-27 04:45:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:31,367 INFO L93 Difference]: Finished difference Result 98 states and 198 transitions. [2019-12-27 04:45:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 04:45:31,368 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-27 04:45:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:31,369 INFO L225 Difference]: With dead ends: 98 [2019-12-27 04:45:31,369 INFO L226 Difference]: Without dead ends: 95 [2019-12-27 04:45:31,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1826, Invalid=3874, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 04:45:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-27 04:45:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2019-12-27 04:45:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-27 04:45:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 112 transitions. [2019-12-27 04:45:31,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 112 transitions. Word has length 43 [2019-12-27 04:45:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:31,372 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 112 transitions. [2019-12-27 04:45:31,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 04:45:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 112 transitions. [2019-12-27 04:45:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 04:45:31,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:31,373 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:31,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:31,573 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1404021454, now seen corresponding path program 70 times [2019-12-27 04:45:31,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:31,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125167920] [2019-12-27 04:45:31,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125167920] [2019-12-27 04:45:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996429510] [2019-12-27 04:45:32,029 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:32,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:45:32,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:32,091 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 04:45:32,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:32,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:32,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 04:45:32,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723617256] [2019-12-27 04:45:32,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 04:45:32,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 04:45:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:45:32,130 INFO L87 Difference]: Start difference. First operand 55 states and 112 transitions. Second operand 40 states. [2019-12-27 04:45:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:33,282 INFO L93 Difference]: Finished difference Result 99 states and 200 transitions. [2019-12-27 04:45:33,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 04:45:33,282 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-27 04:45:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:33,283 INFO L225 Difference]: With dead ends: 99 [2019-12-27 04:45:33,283 INFO L226 Difference]: Without dead ends: 96 [2019-12-27 04:45:33,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1859, Invalid=3841, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 04:45:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-27 04:45:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-27 04:45:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-27 04:45:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 194 transitions. [2019-12-27 04:45:33,287 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 194 transitions. Word has length 43 [2019-12-27 04:45:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:33,288 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 194 transitions. [2019-12-27 04:45:33,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 04:45:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 194 transitions. [2019-12-27 04:45:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 04:45:33,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:33,288 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:33,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:33,489 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1975284683, now seen corresponding path program 71 times [2019-12-27 04:45:33,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:33,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775667957] [2019-12-27 04:45:33,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:33,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775667957] [2019-12-27 04:45:33,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579283847] [2019-12-27 04:45:33,998 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:34,070 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-27 04:45:34,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:34,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 04:45:34,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:34,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:34,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 04:45:34,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047074274] [2019-12-27 04:45:34,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 04:45:34,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 04:45:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:45:34,126 INFO L87 Difference]: Start difference. First operand 96 states and 194 transitions. Second operand 41 states. [2019-12-27 04:45:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:35,541 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2019-12-27 04:45:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 04:45:35,542 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-12-27 04:45:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:35,543 INFO L225 Difference]: With dead ends: 100 [2019-12-27 04:45:35,543 INFO L226 Difference]: Without dead ends: 97 [2019-12-27 04:45:35,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1882, Invalid=3970, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 04:45:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-27 04:45:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2019-12-27 04:45:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-27 04:45:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-27 04:45:35,545 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 44 [2019-12-27 04:45:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:35,546 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-27 04:45:35,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 04:45:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-27 04:45:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 04:45:35,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:35,546 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:35,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:35,747 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -574991809, now seen corresponding path program 72 times [2019-12-27 04:45:35,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:35,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991659848] [2019-12-27 04:45:35,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:36,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991659848] [2019-12-27 04:45:36,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842024966] [2019-12-27 04:45:36,245 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:36,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-27 04:45:36,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:36,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 04:45:36,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:36,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:36,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 04:45:36,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274784531] [2019-12-27 04:45:36,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 04:45:36,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 04:45:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:45:36,360 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 41 states. [2019-12-27 04:45:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:37,452 INFO L93 Difference]: Finished difference Result 101 states and 204 transitions. [2019-12-27 04:45:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 04:45:37,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-12-27 04:45:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:37,454 INFO L225 Difference]: With dead ends: 101 [2019-12-27 04:45:37,454 INFO L226 Difference]: Without dead ends: 98 [2019-12-27 04:45:37,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1768, Invalid=4238, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 04:45:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-27 04:45:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-27 04:45:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-27 04:45:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2019-12-27 04:45:37,458 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 198 transitions. Word has length 44 [2019-12-27 04:45:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:37,458 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 198 transitions. [2019-12-27 04:45:37,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 04:45:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 198 transitions. [2019-12-27 04:45:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 04:45:37,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:37,459 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:37,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:37,662 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1104283334, now seen corresponding path program 73 times [2019-12-27 04:45:37,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:37,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858445821] [2019-12-27 04:45:37,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:38,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858445821] [2019-12-27 04:45:38,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401250261] [2019-12-27 04:45:38,197 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:38,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 04:45:38,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:38,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:38,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 04:45:38,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714151029] [2019-12-27 04:45:38,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 04:45:38,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 04:45:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:45:38,307 INFO L87 Difference]: Start difference. First operand 98 states and 198 transitions. Second operand 42 states. [2019-12-27 04:45:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:39,592 INFO L93 Difference]: Finished difference Result 102 states and 206 transitions. [2019-12-27 04:45:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 04:45:39,593 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-12-27 04:45:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:39,594 INFO L225 Difference]: With dead ends: 102 [2019-12-27 04:45:39,594 INFO L226 Difference]: Without dead ends: 99 [2019-12-27 04:45:39,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2022, Invalid=4298, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 04:45:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-27 04:45:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-12-27 04:45:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-27 04:45:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 116 transitions. [2019-12-27 04:45:39,597 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 116 transitions. Word has length 45 [2019-12-27 04:45:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:39,597 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 116 transitions. [2019-12-27 04:45:39,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 04:45:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 116 transitions. [2019-12-27 04:45:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 04:45:39,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:39,598 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:39,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:39,800 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -644876838, now seen corresponding path program 74 times [2019-12-27 04:45:39,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:39,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188953713] [2019-12-27 04:45:39,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:40,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188953713] [2019-12-27 04:45:40,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124198132] [2019-12-27 04:45:40,311 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:40,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:45:40,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:40,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 04:45:40,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:40,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:40,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 04:45:40,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281744618] [2019-12-27 04:45:40,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 04:45:40,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:40,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 04:45:40,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:45:40,419 INFO L87 Difference]: Start difference. First operand 57 states and 116 transitions. Second operand 42 states. [2019-12-27 04:45:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:41,656 INFO L93 Difference]: Finished difference Result 103 states and 208 transitions. [2019-12-27 04:45:41,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 04:45:41,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-12-27 04:45:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:41,658 INFO L225 Difference]: With dead ends: 103 [2019-12-27 04:45:41,658 INFO L226 Difference]: Without dead ends: 100 [2019-12-27 04:45:41,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2057, Invalid=4263, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 04:45:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-27 04:45:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-27 04:45:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-27 04:45:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 202 transitions. [2019-12-27 04:45:41,661 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 202 transitions. Word has length 45 [2019-12-27 04:45:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:41,661 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 202 transitions. [2019-12-27 04:45:41,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 04:45:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 202 transitions. [2019-12-27 04:45:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 04:45:41,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:41,662 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:41,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:41,863 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash -126954957, now seen corresponding path program 75 times [2019-12-27 04:45:41,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:41,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34416461] [2019-12-27 04:45:41,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:42,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34416461] [2019-12-27 04:45:42,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395619233] [2019-12-27 04:45:42,391 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:42,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-12-27 04:45:42,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:42,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 04:45:42,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:42,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:42,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 04:45:42,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546004938] [2019-12-27 04:45:42,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 04:45:42,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:42,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 04:45:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 04:45:42,504 INFO L87 Difference]: Start difference. First operand 100 states and 202 transitions. Second operand 43 states. [2019-12-27 04:45:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:43,817 INFO L93 Difference]: Finished difference Result 104 states and 210 transitions. [2019-12-27 04:45:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 04:45:43,817 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 46 [2019-12-27 04:45:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:43,818 INFO L225 Difference]: With dead ends: 104 [2019-12-27 04:45:43,818 INFO L226 Difference]: Without dead ends: 101 [2019-12-27 04:45:43,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2081, Invalid=4399, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 04:45:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-27 04:45:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-12-27 04:45:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-27 04:45:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-27 04:45:43,820 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 46 [2019-12-27 04:45:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:43,820 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-27 04:45:43,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 04:45:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-27 04:45:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 04:45:43,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:43,821 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:44,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:44,025 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1483654807, now seen corresponding path program 76 times [2019-12-27 04:45:44,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:44,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622041823] [2019-12-27 04:45:44,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:45:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:44,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622041823] [2019-12-27 04:45:44,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559764961] [2019-12-27 04:45:44,545 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:44,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:45:44,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:45:44,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 04:45:44,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:45:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:45:44,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:45:44,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 04:45:44,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153634480] [2019-12-27 04:45:44,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 04:45:44,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:45:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 04:45:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 04:45:44,644 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 43 states. [2019-12-27 04:45:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:45:45,915 INFO L93 Difference]: Finished difference Result 105 states and 212 transitions. [2019-12-27 04:45:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 04:45:45,916 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 46 [2019-12-27 04:45:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:45:45,917 INFO L225 Difference]: With dead ends: 105 [2019-12-27 04:45:45,917 INFO L226 Difference]: Without dead ends: 102 [2019-12-27 04:45:45,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2123, Invalid=4519, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 04:45:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-27 04:45:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-27 04:45:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-27 04:45:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 206 transitions. [2019-12-27 04:45:45,920 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 206 transitions. Word has length 46 [2019-12-27 04:45:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:45:45,921 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 206 transitions. [2019-12-27 04:45:45,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 04:45:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 206 transitions. [2019-12-27 04:45:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 04:45:45,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:45:45,921 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:45:46,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:45:46,125 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:45:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:45:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 359363934, now seen corresponding path program 77 times [2019-12-27 04:45:46,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:45:46,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058307500] [2019-12-27 04:45:46,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:45:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:45:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:45:46,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:45:46,213 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:45:46,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~j~0_16 6) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= v_~i~0_16 3) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_16, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_10|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_14, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_14, ~i~0=v_~i~0_16, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-27 04:45:46,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-27 04:45:46,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_4 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_10 0) (= v_t1Thread1of1ForFork1_~arg.base_4 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_4, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_4, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= v_t2Thread1of1ForFork0_~arg.offset_4 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_10) (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_4)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_4, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_4, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 20) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:45:46,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 20) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:45:46,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~condI~0_11 0)) (.cse2 (= v_ULTIMATE.start_main_~condJ~0_11 0))) (and (let ((.cse0 (<= 46 v_~i~0_12))) (or (and (= v_ULTIMATE.start_main_~condI~0_11 1) .cse0) (and .cse1 (not .cse0)))) (or (not .cse2) (not .cse1)) (let ((.cse3 (<= 46 v_~j~0_12))) (or (and (not .cse3) .cse2) (and .cse3 (= v_ULTIMATE.start_main_~condJ~0_11 1)))))) InVars {~j~0=v_~j~0_12, ~i~0=v_~i~0_12} OutVars{~j~0=v_~j~0_12, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_11, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_11, ~i~0=v_~i~0_12, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-27 04:45:46,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:45:46 BasicIcfg [2019-12-27 04:45:46,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:45:46,244 INFO L168 Benchmark]: Toolchain (without parser) took 90459.14 ms. Allocated memory was 144.7 MB in the beginning and 509.1 MB in the end (delta: 364.4 MB). Free memory was 101.4 MB in the beginning and 439.2 MB in the end (delta: -337.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,244 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.37 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 160.1 MB in the end (delta: -59.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 202.9 MB. Free memory was 160.1 MB in the beginning and 158.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,245 INFO L168 Benchmark]: Boogie Preprocessor took 24.47 ms. Allocated memory is still 202.9 MB. Free memory was 158.1 MB in the beginning and 156.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,246 INFO L168 Benchmark]: RCFGBuilder took 401.93 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 137.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,246 INFO L168 Benchmark]: TraceAbstraction took 89220.23 ms. Allocated memory was 202.9 MB in the beginning and 509.1 MB in the end (delta: 306.2 MB). Free memory was 136.4 MB in the beginning and 439.2 MB in the end (delta: -302.8 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:45:46,248 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.37 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 160.1 MB in the end (delta: -59.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.45 ms. Allocated memory is still 202.9 MB. Free memory was 160.1 MB in the beginning and 158.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.47 ms. Allocated memory is still 202.9 MB. Free memory was 158.1 MB in the beginning and 156.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.93 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 137.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89220.23 ms. Allocated memory was 202.9 MB in the beginning and 509.1 MB in the end (delta: 306.2 MB). Free memory was 136.4 MB in the beginning and 439.2 MB in the end (delta: -302.8 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 89.0s, OverallIterations: 79, TraceHistogramMax: 20, AutomataDifference: 44.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 841 SDtfs, 2599 SDslu, 3586 SDs, 0 SdLazy, 5346 SolverSat, 5811 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5168 GetRequests, 1924 SyntacticMatches, 0 SemanticMatches, 3244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32328 ImplicationChecksByTransitivity, 54.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=78, 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, 78 MinimizatonAttempts, 931 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 4221 NumberOfCodeBlocks, 4221 NumberOfCodeBlocksAsserted, 533 NumberOfCheckSat, 4022 ConstructedInterpolants, 0 QuantifiedInterpolants, 394964 SizeOfPredicates, 1480 NumberOfNonLiveVariables, 12506 ConjunctsInSsa, 1863 ConjunctsInUnsatCore, 152 InterpolantComputations, 4 PerfectInterpolantSequences, 0/19000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...