/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread/triangular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:47:07,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:47:07,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:47:07,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:47:07,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:47:07,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:47:07,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:47:07,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:47:07,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:47:07,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:47:07,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:47:07,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:47:07,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:47:07,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:47:07,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:47:07,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:47:07,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:47:07,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:47:07,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:47:07,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:47:07,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:47:07,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:47:07,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:47:07,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:47:07,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:47:07,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:47:07,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:47:07,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:47:07,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:47:07,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:47:07,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:47:07,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:47:07,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:47:07,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:47:07,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:47:07,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:47:07,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:47:07,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:47:07,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:47:07,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:47:07,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:47:07,413 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-SemanticLbe.epf [2019-12-27 00:47:07,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:47:07,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:47:07,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:47:07,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:47:07,428 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:47:07,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:47:07,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:47:07,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:47:07,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:47:07,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:47:07,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:47:07,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:47:07,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:47:07,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:47:07,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:47:07,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:47:07,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:47:07,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:47:07,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:47:07,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:47:07,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:47:07,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:47:07,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:47:07,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:47:07,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:47:07,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:47:07,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:47:07,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:47:07,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:47:07,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:47:07,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:47:07,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:47:07,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:47:07,767 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:47:07,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-1.i [2019-12-27 00:47:07,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dfecb53/c53d8ef0923243c985cf281c6f979390/FLAG500b92477 [2019-12-27 00:47:08,347 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:47:08,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-1.i [2019-12-27 00:47:08,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dfecb53/c53d8ef0923243c985cf281c6f979390/FLAG500b92477 [2019-12-27 00:47:08,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dfecb53/c53d8ef0923243c985cf281c6f979390 [2019-12-27 00:47:08,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:47:08,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:47:08,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:47:08,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:47:08,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:47:08,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:47:08" (1/1) ... [2019-12-27 00:47:08,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dfbf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:08, skipping insertion in model container [2019-12-27 00:47:08,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:47:08" (1/1) ... [2019-12-27 00:47:08,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:47:08,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:47:09,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:47:09,308 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:47:09,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:47:09,475 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:47:09,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09 WrapperNode [2019-12-27 00:47:09,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:47:09,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:47:09,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:47:09,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:47:09,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:47:09,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:47:09,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:47:09,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:47:09,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (1/1) ... [2019-12-27 00:47:09,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:47:09,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:47:09,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:47:09,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:47:09,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (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 00:47:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 00:47:09,631 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 00:47:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 00:47:09,633 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 00:47:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:47:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:47:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:47:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:47:09,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:47:09,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:47:09,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:47:09,638 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 00:47:09,988 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:47:09,988 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 00:47:09,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:47:09 BoogieIcfgContainer [2019-12-27 00:47:09,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:47:09,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:47:09,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:47:09,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:47:09,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:47:08" (1/3) ... [2019-12-27 00:47:09,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564c32d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:47:09, skipping insertion in model container [2019-12-27 00:47:09,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:47:09" (2/3) ... [2019-12-27 00:47:09,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564c32d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:47:09, skipping insertion in model container [2019-12-27 00:47:09,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:47:09" (3/3) ... [2019-12-27 00:47:09,998 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-1.i [2019-12-27 00:47:10,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:47:10,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:47:10,013 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 00:47:10,014 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:47:10,041 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,041 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,041 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,042 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,042 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,042 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,043 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,043 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,043 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,043 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,043 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,044 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,044 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,044 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,045 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,045 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,045 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,045 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,046 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,046 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,046 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,046 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,047 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,047 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,047 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,047 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,048 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,048 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,051 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,051 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,052 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,052 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,052 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,052 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,060 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,060 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,060 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,061 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,061 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,061 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:10,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 00:47:10,097 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:47:10,097 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:47:10,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:47:10,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:47:10,098 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:47:10,098 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:47:10,098 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:47:10,098 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:47:10,112 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-27 00:47:10,114 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 00:47:10,159 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 00:47:10,159 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:47:10,172 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 00:47:10,175 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 00:47:10,200 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 00:47:10,201 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:47:10,202 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 00:47:10,204 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-27 00:47:10,205 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:47:11,288 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 00:47:11,422 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-27 00:47:11,422 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-27 00:47:11,425 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-27 00:47:11,432 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-27 00:47:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-27 00:47:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:47:11,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:11,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:47:11,439 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:11,444 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-27 00:47:11,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:11,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107909823] [2019-12-27 00:47:11,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:11,640 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 00:47:11,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107909823] [2019-12-27 00:47:11,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:11,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:47:11,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545091828] [2019-12-27 00:47:11,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:47:11,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:47:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:11,664 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-27 00:47:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:11,697 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-27 00:47:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:47:11,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:47:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:11,724 INFO L225 Difference]: With dead ends: 48 [2019-12-27 00:47:11,724 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 00:47:11,725 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 00:47:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 00:47:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 00:47:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 00:47:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-27 00:47:11,761 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-27 00:47:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:11,762 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-27 00:47:11,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:47:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-27 00:47:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:47:11,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:11,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:11,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-27 00:47:11,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:11,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078459006] [2019-12-27 00:47:11,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:11,866 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 00:47:11,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078459006] [2019-12-27 00:47:11,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:11,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:11,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11849445] [2019-12-27 00:47:11,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:47:11,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:47:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:11,870 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-27 00:47:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:11,890 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 00:47:11,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:47:11,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 00:47:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:11,892 INFO L225 Difference]: With dead ends: 34 [2019-12-27 00:47:11,893 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 00:47:11,893 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 00:47:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 00:47:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 00:47:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 00:47:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 00:47:11,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-27 00:47:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:11,902 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 00:47:11,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:47:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 00:47:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:47:11,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:11,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:11,905 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-27 00:47:11,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:11,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59637474] [2019-12-27 00:47:11,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:11,992 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 00:47:11,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59637474] [2019-12-27 00:47:11,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:11,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:47:11,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792946112] [2019-12-27 00:47:11,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:47:11,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:47:11,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:47:11,995 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-27 00:47:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:12,027 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 00:47:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:12,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:47:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:12,029 INFO L225 Difference]: With dead ends: 34 [2019-12-27 00:47:12,029 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 00:47:12,029 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 00:47:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 00:47:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-27 00:47:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 00:47:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 00:47:12,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-27 00:47:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:12,034 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 00:47:12,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:47:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 00:47:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:47:12,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:12,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:12,036 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:12,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-27 00:47:12,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:12,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397735314] [2019-12-27 00:47:12,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:12,079 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 00:47:12,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397735314] [2019-12-27 00:47:12,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:12,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:47:12,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959281339] [2019-12-27 00:47:12,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:47:12,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:12,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:47:12,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:47:12,082 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-27 00:47:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:12,119 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 00:47:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:47:12,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:47:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:12,121 INFO L225 Difference]: With dead ends: 32 [2019-12-27 00:47:12,121 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 00:47:12,121 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 00:47:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 00:47:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 00:47:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 00:47:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 00:47:12,126 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-27 00:47:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:12,127 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 00:47:12,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:47:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 00:47:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:47:12,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:12,128 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:12,128 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-27 00:47:12,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:12,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677694419] [2019-12-27 00:47:12,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:12,174 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 00:47:12,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677694419] [2019-12-27 00:47:12,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394137893] [2019-12-27 00:47:12,175 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 00:47:12,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:47:12,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:12,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:47:12,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:12,298 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 00:47:12,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:12,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 00:47:12,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529031347] [2019-12-27 00:47:12,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:47:12,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:47:12,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:47:12,301 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-27 00:47:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:12,400 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 00:47:12,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:47:12,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 00:47:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:12,402 INFO L225 Difference]: With dead ends: 32 [2019-12-27 00:47:12,402 INFO L226 Difference]: Without dead ends: 29 [2019-12-27 00:47:12,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-27 00:47:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-27 00:47:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 00:47:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 00:47:12,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-27 00:47:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:12,410 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 00:47:12,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:47:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 00:47:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:47:12,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:12,410 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:12,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:12,612 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-27 00:47:12,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:12,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120952515] [2019-12-27 00:47:12,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:12,681 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 00:47:12,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120952515] [2019-12-27 00:47:12,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813414494] [2019-12-27 00:47:12,682 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 00:47:12,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:47:12,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:12,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:47:12,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:12,767 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 00:47:12,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:12,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 00:47:12,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675410034] [2019-12-27 00:47:12,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:47:12,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:47:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:47:12,769 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-27 00:47:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:12,850 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-27 00:47:12,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:47:12,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 00:47:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:12,851 INFO L225 Difference]: With dead ends: 33 [2019-12-27 00:47:12,851 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 00:47:12,852 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 00:47:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 00:47:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 00:47:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 00:47:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 00:47:12,856 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-27 00:47:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:12,857 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 00:47:12,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:47:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 00:47:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:47:12,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:12,858 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:13,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:13,066 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-27 00:47:13,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:13,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445473054] [2019-12-27 00:47:13,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:13,153 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 00:47:13,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445473054] [2019-12-27 00:47:13,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754271411] [2019-12-27 00:47:13,154 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 00:47:13,211 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:47:13,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:13,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:47:13,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:13,236 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 00:47:13,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:13,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 00:47:13,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179005487] [2019-12-27 00:47:13,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:13,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:13,238 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-27 00:47:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:13,345 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 00:47:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:47:13,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-27 00:47:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:13,347 INFO L225 Difference]: With dead ends: 34 [2019-12-27 00:47:13,347 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 00:47:13,348 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 00:47:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 00:47:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-27 00:47:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 00:47:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-27 00:47:13,352 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-27 00:47:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:13,353 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-27 00:47:13,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-27 00:47:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:47:13,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:13,354 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:13,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:13,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:13,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-27 00:47:13,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473008880] [2019-12-27 00:47:13,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:13,631 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 00:47:13,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473008880] [2019-12-27 00:47:13,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850620290] [2019-12-27 00:47:13,632 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 00:47:13,687 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 00:47:13,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:13,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:47:13,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:13,704 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 00:47:13,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:13,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 00:47:13,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275307047] [2019-12-27 00:47:13,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:13,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:13,707 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-27 00:47:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:13,792 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-27 00:47:13,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:47:13,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-27 00:47:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:13,794 INFO L225 Difference]: With dead ends: 35 [2019-12-27 00:47:13,794 INFO L226 Difference]: Without dead ends: 32 [2019-12-27 00:47:13,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-27 00:47:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-27 00:47:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 00:47:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 00:47:13,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-27 00:47:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:13,798 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 00:47:13,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 00:47:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 00:47:13,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:13,799 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:14,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:14,003 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:14,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:14,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-27 00:47:14,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:14,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408974695] [2019-12-27 00:47:14,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:14,076 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 00:47:14,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408974695] [2019-12-27 00:47:14,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754898866] [2019-12-27 00:47:14,077 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 00:47:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:14,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:47:14,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:14,145 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 00:47:14,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:14,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 00:47:14,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230577330] [2019-12-27 00:47:14,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:47:14,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:47:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:47:14,148 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-27 00:47:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:14,223 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-27 00:47:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:47:14,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-27 00:47:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:14,224 INFO L225 Difference]: With dead ends: 36 [2019-12-27 00:47:14,224 INFO L226 Difference]: Without dead ends: 33 [2019-12-27 00:47:14,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:47:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-27 00:47:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-27 00:47:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 00:47:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-27 00:47:14,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-27 00:47:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:14,232 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-27 00:47:14,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:47:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-27 00:47:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 00:47:14,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:14,233 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:14,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:14,433 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-27 00:47:14,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:14,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774190837] [2019-12-27 00:47:14,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:14,506 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 00:47:14,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774190837] [2019-12-27 00:47:14,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251150622] [2019-12-27 00:47:14,507 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 00:47:14,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:47:14,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:14,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:47:14,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:14,580 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 00:47:14,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:14,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 00:47:14,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143285851] [2019-12-27 00:47:14,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:47:14,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:47:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:47:14,582 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-27 00:47:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:14,685 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-27 00:47:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:47:14,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-27 00:47:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:14,686 INFO L225 Difference]: With dead ends: 37 [2019-12-27 00:47:14,686 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 00:47:14,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:47:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 00:47:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 00:47:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 00:47:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 00:47:14,690 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-27 00:47:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:14,691 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 00:47:14,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:47:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 00:47:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:47:14,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:14,692 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:14,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:14,899 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-27 00:47:14,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:14,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910647035] [2019-12-27 00:47:14,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:14,962 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 00:47:14,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910647035] [2019-12-27 00:47:14,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500462938] [2019-12-27 00:47:14,963 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 00:47:15,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 00:47:15,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:15,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 00:47:15,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:15,055 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 00:47:15,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:15,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 00:47:15,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405865424] [2019-12-27 00:47:15,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 00:47:15,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 00:47:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:15,058 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-27 00:47:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:15,188 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-27 00:47:15,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:47:15,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-27 00:47:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:15,191 INFO L225 Difference]: With dead ends: 38 [2019-12-27 00:47:15,191 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 00:47:15,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:47:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 00:47:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-27 00:47:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-27 00:47:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-27 00:47:15,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-27 00:47:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:15,195 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-27 00:47:15,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 00:47:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-27 00:47:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:47:15,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:15,196 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:15,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:15,403 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-27 00:47:15,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:15,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789535893] [2019-12-27 00:47:15,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:15,473 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 00:47:15,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789535893] [2019-12-27 00:47:15,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481132886] [2019-12-27 00:47:15,474 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 00:47:15,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:47:15,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:15,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 00:47:15,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:15,535 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 00:47:15,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:15,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 00:47:15,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468401584] [2019-12-27 00:47:15,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 00:47:15,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 00:47:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:15,537 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-27 00:47:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:15,663 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-27 00:47:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:47:15,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-27 00:47:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:15,664 INFO L225 Difference]: With dead ends: 39 [2019-12-27 00:47:15,665 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 00:47:15,665 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 00:47:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 00:47:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 00:47:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 00:47:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 00:47:15,669 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-27 00:47:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:15,669 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 00:47:15,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 00:47:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 00:47:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:47:15,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:15,670 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:15,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:15,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-27 00:47:15,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:15,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300974301] [2019-12-27 00:47:15,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:15,951 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 00:47:15,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300974301] [2019-12-27 00:47:15,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617899842] [2019-12-27 00:47:15,953 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 00:47:16,009 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 00:47:16,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:16,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 00:47:16,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:16,030 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 00:47:16,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:16,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 00:47:16,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695821153] [2019-12-27 00:47:16,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:47:16,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:47:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:47:16,033 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-27 00:47:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:16,179 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-27 00:47:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:47:16,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 00:47:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:16,181 INFO L225 Difference]: With dead ends: 40 [2019-12-27 00:47:16,181 INFO L226 Difference]: Without dead ends: 37 [2019-12-27 00:47:16,182 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 00:47:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-27 00:47:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-27 00:47:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-27 00:47:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-27 00:47:16,185 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-27 00:47:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:16,186 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-27 00:47:16,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:47:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-27 00:47:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:47:16,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:16,187 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:16,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:16,391 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-27 00:47:16,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957224464] [2019-12-27 00:47:16,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:16,475 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 00:47:16,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957224464] [2019-12-27 00:47:16,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195167481] [2019-12-27 00:47:16,476 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 00:47:16,533 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 00:47:16,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:16,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 00:47:16,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:16,548 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 00:47:16,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:16,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 00:47:16,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945882214] [2019-12-27 00:47:16,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:47:16,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:16,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:47:16,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:47:16,551 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-27 00:47:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:16,704 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-27 00:47:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 00:47:16,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 00:47:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:16,705 INFO L225 Difference]: With dead ends: 41 [2019-12-27 00:47:16,706 INFO L226 Difference]: Without dead ends: 38 [2019-12-27 00:47:16,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:47:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-27 00:47:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-27 00:47:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 00:47:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 00:47:16,710 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-27 00:47:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:16,710 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 00:47:16,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:47:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 00:47:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:47:16,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:16,711 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:16,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:16,912 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:16,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-27 00:47:16,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:16,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467036732] [2019-12-27 00:47:16,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:16,991 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 00:47:16,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467036732] [2019-12-27 00:47:16,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702428130] [2019-12-27 00:47:16,991 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 00:47:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:17,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 00:47:17,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:17,069 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 00:47:17,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:17,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 00:47:17,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638887981] [2019-12-27 00:47:17,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:47:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:17,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:47:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:17,071 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-27 00:47:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:17,235 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-27 00:47:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:47:17,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:47:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:17,236 INFO L225 Difference]: With dead ends: 42 [2019-12-27 00:47:17,236 INFO L226 Difference]: Without dead ends: 39 [2019-12-27 00:47:17,238 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 00:47:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-27 00:47:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-27 00:47:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-27 00:47:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-27 00:47:17,242 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-27 00:47:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:17,242 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-27 00:47:17,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:47:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-27 00:47:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:47:17,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:17,243 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:17,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:17,446 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-27 00:47:17,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:17,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690563336] [2019-12-27 00:47:17,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:17,526 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 00:47:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690563336] [2019-12-27 00:47:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254098283] [2019-12-27 00:47:17,527 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 00:47:17,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:47:17,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:17,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 00:47:17,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:17,617 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 00:47:17,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:17,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 00:47:17,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764097182] [2019-12-27 00:47:17,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:47:17,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:17,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:47:17,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:17,619 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-27 00:47:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:17,772 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-27 00:47:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:47:17,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:47:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:17,773 INFO L225 Difference]: With dead ends: 43 [2019-12-27 00:47:17,773 INFO L226 Difference]: Without dead ends: 40 [2019-12-27 00:47:17,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:47:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-27 00:47:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-27 00:47:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 00:47:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 00:47:17,777 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-27 00:47:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:17,778 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 00:47:17,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:47:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 00:47:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:47:17,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:17,779 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:17,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:17,982 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-27 00:47:17,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:17,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107548345] [2019-12-27 00:47:17,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:18,084 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 00:47:18,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107548345] [2019-12-27 00:47:18,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700421286] [2019-12-27 00:47:18,085 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 00:47:18,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 00:47:18,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:18,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 00:47:18,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:18,159 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 00:47:18,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:18,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 00:47:18,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349942496] [2019-12-27 00:47:18,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:47:18,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:47:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:47:18,162 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-27 00:47:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:18,362 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-27 00:47:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:47:18,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 00:47:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:18,363 INFO L225 Difference]: With dead ends: 44 [2019-12-27 00:47:18,364 INFO L226 Difference]: Without dead ends: 41 [2019-12-27 00:47:18,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:47:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-27 00:47:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-27 00:47:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 00:47:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 00:47:18,368 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-27 00:47:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:18,368 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 00:47:18,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:47:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 00:47:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:47:18,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:18,369 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:18,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:18,573 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-27 00:47:18,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:18,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802793586] [2019-12-27 00:47:18,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:18,674 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 00:47:18,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802793586] [2019-12-27 00:47:18,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748832192] [2019-12-27 00:47:18,675 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 00:47:18,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:47:18,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:18,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 00:47:18,732 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:18,749 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 00:47:18,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:18,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 00:47:18,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699234698] [2019-12-27 00:47:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:47:18,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:47:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:47:18,751 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-27 00:47:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:18,953 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-27 00:47:18,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:47:18,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 00:47:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:18,955 INFO L225 Difference]: With dead ends: 45 [2019-12-27 00:47:18,955 INFO L226 Difference]: Without dead ends: 42 [2019-12-27 00:47:18,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:47:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-27 00:47:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-27 00:47:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 00:47:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 00:47:18,959 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-27 00:47:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:18,959 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 00:47:18,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:47:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 00:47:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:47:18,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:18,960 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:19,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:19,164 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-27 00:47:19,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:19,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374667553] [2019-12-27 00:47:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:19,342 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 00:47:19,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374667553] [2019-12-27 00:47:19,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697009972] [2019-12-27 00:47:19,343 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 00:47:19,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 00:47:19,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:19,423 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 00:47:19,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:19,452 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 00:47:19,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:19,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 00:47:19,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267632308] [2019-12-27 00:47:19,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:47:19,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:47:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:47:19,454 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 14 states. [2019-12-27 00:47:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:19,818 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-27 00:47:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:47:19,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 00:47:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:19,820 INFO L225 Difference]: With dead ends: 46 [2019-12-27 00:47:19,820 INFO L226 Difference]: Without dead ends: 43 [2019-12-27 00:47:19,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-12-27 00:47:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-27 00:47:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-27 00:47:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-27 00:47:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-27 00:47:19,830 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-27 00:47:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:19,830 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-27 00:47:19,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:47:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-27 00:47:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:47:19,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:19,831 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:20,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:20,035 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-27 00:47:20,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:20,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975436812] [2019-12-27 00:47:20,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:20,135 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 00:47:20,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975436812] [2019-12-27 00:47:20,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462575105] [2019-12-27 00:47:20,136 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 00:47:20,196 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 00:47:20,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:20,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 00:47:20,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:20,221 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 00:47:20,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:20,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 00:47:20,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387648768] [2019-12-27 00:47:20,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:47:20,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:47:20,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:47:20,224 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 14 states. [2019-12-27 00:47:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:20,434 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-27 00:47:20,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:47:20,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 00:47:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:20,436 INFO L225 Difference]: With dead ends: 47 [2019-12-27 00:47:20,436 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 00:47:20,436 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 00:47:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 00:47:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 00:47:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 00:47:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 00:47:20,439 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-27 00:47:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:20,439 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 00:47:20,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:47:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 00:47:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:47:20,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:20,441 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:20,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:20,644 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-27 00:47:20,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:20,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407334680] [2019-12-27 00:47:20,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:47:20,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407334680] [2019-12-27 00:47:20,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615138719] [2019-12-27 00:47:20,718 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 00:47:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:20,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:47:20,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:47:20,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 00:47:20,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2019-12-27 00:47:20,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979701083] [2019-12-27 00:47:20,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:20,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:47:20,768 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 8 states. [2019-12-27 00:47:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:20,788 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2019-12-27 00:47:20,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:47:20,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-27 00:47:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:20,789 INFO L225 Difference]: With dead ends: 96 [2019-12-27 00:47:20,789 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 00:47:20,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:47:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 00:47:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 00:47:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 00:47:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-12-27 00:47:20,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 18 [2019-12-27 00:47:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:20,792 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-12-27 00:47:20,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-12-27 00:47:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:47:20,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:20,793 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:20,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:20,998 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-27 00:47:20,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:21,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762843561] [2019-12-27 00:47:21,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:21,098 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 00:47:21,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762843561] [2019-12-27 00:47:21,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665516363] [2019-12-27 00:47:21,099 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 00:47:21,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:47:21,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:47:21,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:47:21,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:47:21,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 00:47:21,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 20 [2019-12-27 00:47:21,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353812636] [2019-12-27 00:47:21,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:21,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:21,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:47:21,241 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 8 states. [2019-12-27 00:47:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:21,255 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-12-27 00:47:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:47:21,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-27 00:47:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:21,257 INFO L225 Difference]: With dead ends: 46 [2019-12-27 00:47:21,258 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 00:47:21,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:47:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 00:47:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 00:47:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 00:47:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 00:47:21,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-12-27 00:47:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:21,259 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 00:47:21,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 00:47:21,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 00:47:21,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:21,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:47:21 BasicIcfg [2019-12-27 00:47:21,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:47:21,466 INFO L168 Benchmark]: Toolchain (without parser) took 12817.87 ms. Allocated memory was 145.8 MB in the beginning and 296.2 MB in the end (delta: 150.5 MB). Free memory was 102.5 MB in the beginning and 98.0 MB in the end (delta: 4.5 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,466 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.11 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 102.1 MB in the beginning and 161.2 MB in the end (delta: -59.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.33 ms. Allocated memory is still 201.9 MB. Free memory was 161.2 MB in the beginning and 159.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,467 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 ms. Allocated memory is still 201.9 MB. Free memory was 159.3 MB in the beginning and 157.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,468 INFO L168 Benchmark]: RCFGBuilder took 422.29 ms. Allocated memory is still 201.9 MB. Free memory was 157.9 MB in the beginning and 138.3 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,468 INFO L168 Benchmark]: TraceAbstraction took 11473.79 ms. Allocated memory was 201.9 MB in the beginning and 296.2 MB in the end (delta: 94.4 MB). Free memory was 137.7 MB in the beginning and 98.0 MB in the end (delta: 39.7 MB). Peak memory consumption was 134.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:47:21,473 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.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.11 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 102.1 MB in the beginning and 161.2 MB in the end (delta: -59.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.33 ms. Allocated memory is still 201.9 MB. Free memory was 161.2 MB in the beginning and 159.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.23 ms. Allocated memory is still 201.9 MB. Free memory was 159.3 MB in the beginning and 157.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 422.29 ms. Allocated memory is still 201.9 MB. Free memory was 157.9 MB in the beginning and 138.3 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11473.79 ms. Allocated memory was 201.9 MB in the beginning and 296.2 MB in the end (delta: 94.4 MB). Free memory was 137.7 MB in the beginning and 98.0 MB in the end (delta: 39.7 MB). Peak memory consumption was 134.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 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, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - PositiveResult [Line: 703]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 11.3s, OverallIterations: 22, TraceHistogramMax: 6, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 274 SDtfs, 618 SDslu, 433 SDs, 0 SdLazy, 520 SolverSat, 401 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 90 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 21188 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1782 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 40 InterpolantComputations, 6 PerfectInterpolantSequences, 70/380 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 correct! Received shutdown request...