/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:41:33,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:41:33,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:41:33,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:41:33,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:41:33,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:41:33,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:41:33,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:41:33,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:41:33,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:41:33,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:41:33,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:41:33,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:41:33,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:41:33,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:41:33,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:41:33,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:41:33,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:41:33,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:41:33,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:41:33,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:41:33,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:41:33,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:41:33,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:41:33,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:41:33,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:41:33,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:41:33,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:41:33,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:41:33,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:41:33,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:41:33,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:41:33,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:41:33,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:41:33,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:41:33,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:41:33,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:41:33,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:41:33,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:41:33,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:41:33,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:41:33,765 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-NoLbe.epf [2019-12-27 08:41:33,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:41:33,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:41:33,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:41:33,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:41:33,805 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:41:33,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:41:33,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:41:33,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:41:33,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:41:33,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:41:33,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:41:33,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:41:33,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:41:33,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:41:33,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:41:33,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:41:33,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:41:33,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:41:33,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:41:33,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:41:33,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:41:33,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:41:33,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:41:33,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:41:33,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:41:33,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:41:33,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:41:33,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 08:41:33,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:41:33,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:41:34,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:41:34,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:41:34,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:41:34,100 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:41:34,100 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:41:34,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 08:41:34,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b990350f8/fd90dc3fb3e643e8bb7686e72ce32d79/FLAG7c20bf959 [2019-12-27 08:41:34,826 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:41:34,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 08:41:34,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b990350f8/fd90dc3fb3e643e8bb7686e72ce32d79/FLAG7c20bf959 [2019-12-27 08:41:35,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b990350f8/fd90dc3fb3e643e8bb7686e72ce32d79 [2019-12-27 08:41:35,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:41:35,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:41:35,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:41:35,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:41:35,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:41:35,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8456dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35, skipping insertion in model container [2019-12-27 08:41:35,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:41:35,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:41:35,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:41:35,670 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:41:35,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:41:35,826 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:41:35,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35 WrapperNode [2019-12-27 08:41:35,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:41:35,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:41:35,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:41:35,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:41:35,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:41:35,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:41:35,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:41:35,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:41:35,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (1/1) ... [2019-12-27 08:41:35,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:41:35,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:41:35,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:41:35,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:41:35,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (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 08:41:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 08:41:35,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 08:41:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 08:41:35,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 08:41:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:41:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:41:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:41:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:41:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:41:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:41:35,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:41:35,966 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 08:41:36,321 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:41:36,322 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 08:41:36,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:36 BoogieIcfgContainer [2019-12-27 08:41:36,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:41:36,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:41:36,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:41:36,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:41:36,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:41:35" (1/3) ... [2019-12-27 08:41:36,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:36, skipping insertion in model container [2019-12-27 08:41:36,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:35" (2/3) ... [2019-12-27 08:41:36,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:36, skipping insertion in model container [2019-12-27 08:41:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:36" (3/3) ... [2019-12-27 08:41:36,331 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2019-12-27 08:41:36,344 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:41:36,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:41:36,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 08:41:36,353 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:41:36,379 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,379 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,379 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,380 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,380 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,380 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,381 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,381 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,381 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,382 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,382 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,382 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,382 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,383 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,383 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,384 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,384 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,384 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,384 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,385 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,385 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,385 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,386 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,388 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,388 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,389 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,389 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,389 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,394 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,395 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,395 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,395 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,396 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,396 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,404 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,405 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,405 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,405 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,406 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,406 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:36,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 08:41:36,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:41:36,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:41:36,441 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:41:36,441 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:41:36,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:41:36,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:41:36,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:41:36,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:41:36,450 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 51 transitions [2019-12-27 08:41:36,532 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1013 states. [2019-12-27 08:41:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-27 08:41:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 08:41:36,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:36,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:36,547 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash -910010, now seen corresponding path program 1 times [2019-12-27 08:41:36,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:36,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666987402] [2019-12-27 08:41:36,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:36,994 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 08:41:36,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666987402] [2019-12-27 08:41:36,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:36,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:41:36,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186459670] [2019-12-27 08:41:37,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:41:37,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:37,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:41:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:41:37,026 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 5 states. [2019-12-27 08:41:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:37,214 INFO L93 Difference]: Finished difference Result 1778 states and 5126 transitions. [2019-12-27 08:41:37,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:41:37,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 08:41:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:37,238 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 08:41:37,238 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 08:41:37,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:41:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 08:41:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 388. [2019-12-27 08:41:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 08:41:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 993 transitions. [2019-12-27 08:41:37,330 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 993 transitions. Word has length 20 [2019-12-27 08:41:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:37,330 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 993 transitions. [2019-12-27 08:41:37,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:41:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 993 transitions. [2019-12-27 08:41:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:41:37,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:37,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:37,333 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 723642448, now seen corresponding path program 1 times [2019-12-27 08:41:37,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:37,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638270352] [2019-12-27 08:41:37,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:37,498 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 08:41:37,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638270352] [2019-12-27 08:41:37,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:37,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:41:37,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358389871] [2019-12-27 08:41:37,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:41:37,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:41:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:41:37,502 INFO L87 Difference]: Start difference. First operand 388 states and 993 transitions. Second operand 5 states. [2019-12-27 08:41:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:37,637 INFO L93 Difference]: Finished difference Result 563 states and 1392 transitions. [2019-12-27 08:41:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:41:37,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 08:41:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:37,642 INFO L225 Difference]: With dead ends: 563 [2019-12-27 08:41:37,642 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 08:41:37,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:41:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 08:41:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-12-27 08:41:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-27 08:41:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 883 transitions. [2019-12-27 08:41:37,695 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 883 transitions. Word has length 23 [2019-12-27 08:41:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:37,695 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 883 transitions. [2019-12-27 08:41:37,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:41:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 883 transitions. [2019-12-27 08:41:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:41:37,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:37,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:37,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -660572760, now seen corresponding path program 1 times [2019-12-27 08:41:37,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:37,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274684464] [2019-12-27 08:41:37,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:37,833 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 08:41:37,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274684464] [2019-12-27 08:41:37,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:37,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:41:37,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638915455] [2019-12-27 08:41:37,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:41:37,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:41:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:41:37,837 INFO L87 Difference]: Start difference. First operand 354 states and 883 transitions. Second operand 5 states. [2019-12-27 08:41:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:37,900 INFO L93 Difference]: Finished difference Result 431 states and 1037 transitions. [2019-12-27 08:41:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:41:37,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 08:41:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:37,903 INFO L225 Difference]: With dead ends: 431 [2019-12-27 08:41:37,903 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 08:41:37,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:41:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 08:41:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 288. [2019-12-27 08:41:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-27 08:41:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 709 transitions. [2019-12-27 08:41:37,915 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 709 transitions. Word has length 23 [2019-12-27 08:41:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:37,915 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 709 transitions. [2019-12-27 08:41:37,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:41:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 709 transitions. [2019-12-27 08:41:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:41:37,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:37,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:37,917 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash -962769584, now seen corresponding path program 1 times [2019-12-27 08:41:37,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:37,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638026858] [2019-12-27 08:41:37,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:38,049 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 08:41:38,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638026858] [2019-12-27 08:41:38,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:38,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:41:38,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058850343] [2019-12-27 08:41:38,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:41:38,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:41:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:41:38,052 INFO L87 Difference]: Start difference. First operand 288 states and 709 transitions. Second operand 6 states. [2019-12-27 08:41:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:38,182 INFO L93 Difference]: Finished difference Result 448 states and 1078 transitions. [2019-12-27 08:41:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:41:38,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 08:41:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:38,185 INFO L225 Difference]: With dead ends: 448 [2019-12-27 08:41:38,186 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 08:41:38,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:41:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 08:41:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-12-27 08:41:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 08:41:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 773 transitions. [2019-12-27 08:41:38,201 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 773 transitions. Word has length 26 [2019-12-27 08:41:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:38,202 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 773 transitions. [2019-12-27 08:41:38,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:41:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 773 transitions. [2019-12-27 08:41:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:41:38,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:38,208 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:38,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash -327915495, now seen corresponding path program 1 times [2019-12-27 08:41:38,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:38,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575071846] [2019-12-27 08:41:38,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:38,364 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 08:41:38,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575071846] [2019-12-27 08:41:38,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244344382] [2019-12-27 08:41:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 08:41:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:38,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:41:38,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:38,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:38,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:38,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:38,510 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 08:41:38,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:38,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 08:41:38,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139449156] [2019-12-27 08:41:38,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:41:38,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:41:38,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:41:38,512 INFO L87 Difference]: Start difference. First operand 320 states and 773 transitions. Second operand 8 states. [2019-12-27 08:41:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:38,663 INFO L93 Difference]: Finished difference Result 467 states and 1116 transitions. [2019-12-27 08:41:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:41:38,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 08:41:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:38,668 INFO L225 Difference]: With dead ends: 467 [2019-12-27 08:41:38,669 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 08:41:38,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:41:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 08:41:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2019-12-27 08:41:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-27 08:41:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 735 transitions. [2019-12-27 08:41:38,694 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 735 transitions. Word has length 30 [2019-12-27 08:41:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:38,695 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 735 transitions. [2019-12-27 08:41:38,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:41:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 735 transitions. [2019-12-27 08:41:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:41:38,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:38,698 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:38,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:38,904 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash -243930643, now seen corresponding path program 1 times [2019-12-27 08:41:38,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:38,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245060815] [2019-12-27 08:41:38,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:39,025 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 08:41:39,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245060815] [2019-12-27 08:41:39,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505526516] [2019-12-27 08:41:39,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 08:41:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:39,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:41:39,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:39,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:39,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:39,126 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 08:41:39,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:39,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 08:41:39,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296915936] [2019-12-27 08:41:39,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:41:39,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:41:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:41:39,130 INFO L87 Difference]: Start difference. First operand 301 states and 735 transitions. Second operand 8 states. [2019-12-27 08:41:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:39,232 INFO L93 Difference]: Finished difference Result 581 states and 1393 transitions. [2019-12-27 08:41:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:41:39,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 08:41:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:39,239 INFO L225 Difference]: With dead ends: 581 [2019-12-27 08:41:39,239 INFO L226 Difference]: Without dead ends: 368 [2019-12-27 08:41:39,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:41:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-27 08:41:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 314. [2019-12-27 08:41:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-27 08:41:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 761 transitions. [2019-12-27 08:41:39,255 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 761 transitions. Word has length 30 [2019-12-27 08:41:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:39,255 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 761 transitions. [2019-12-27 08:41:39,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:41:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 761 transitions. [2019-12-27 08:41:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 08:41:39,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:39,259 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:39,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:39,463 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1994322550, now seen corresponding path program 1 times [2019-12-27 08:41:39,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:39,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215001249] [2019-12-27 08:41:39,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:39,605 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 08:41:39,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215001249] [2019-12-27 08:41:39,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120558718] [2019-12-27 08:41:39,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 08:41:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:39,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 08:41:39,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:39,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:39,736 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 08:41:39,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:39,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 08:41:39,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255886040] [2019-12-27 08:41:39,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:41:39,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:41:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:41:39,739 INFO L87 Difference]: Start difference. First operand 314 states and 761 transitions. Second operand 9 states. [2019-12-27 08:41:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:39,905 INFO L93 Difference]: Finished difference Result 629 states and 1489 transitions. [2019-12-27 08:41:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:41:39,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 08:41:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:39,909 INFO L225 Difference]: With dead ends: 629 [2019-12-27 08:41:39,909 INFO L226 Difference]: Without dead ends: 440 [2019-12-27 08:41:39,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:41:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-27 08:41:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 412. [2019-12-27 08:41:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-27 08:41:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 961 transitions. [2019-12-27 08:41:39,923 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 961 transitions. Word has length 34 [2019-12-27 08:41:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:39,924 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 961 transitions. [2019-12-27 08:41:39,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:41:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 961 transitions. [2019-12-27 08:41:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 08:41:39,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:39,925 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:40,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:40,129 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:40,130 INFO L82 PathProgramCache]: Analyzing trace with hash -40518361, now seen corresponding path program 2 times [2019-12-27 08:41:40,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:40,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643275363] [2019-12-27 08:41:40,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:40,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643275363] [2019-12-27 08:41:40,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823042757] [2019-12-27 08:41:40,295 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 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 08:41:40,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:41:40,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:40,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 08:41:40,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:40,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:40,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:40,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:40,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:40,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 08:41:40,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828570356] [2019-12-27 08:41:40,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 08:41:40,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 08:41:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:41:40,398 INFO L87 Difference]: Start difference. First operand 412 states and 961 transitions. Second operand 10 states. [2019-12-27 08:41:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:40,596 INFO L93 Difference]: Finished difference Result 669 states and 1569 transitions. [2019-12-27 08:41:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:41:40,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-27 08:41:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:40,599 INFO L225 Difference]: With dead ends: 669 [2019-12-27 08:41:40,599 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 08:41:40,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:41:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 08:41:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 346. [2019-12-27 08:41:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-27 08:41:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 825 transitions. [2019-12-27 08:41:40,611 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 825 transitions. Word has length 38 [2019-12-27 08:41:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:40,612 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 825 transitions. [2019-12-27 08:41:40,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 08:41:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 825 transitions. [2019-12-27 08:41:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 08:41:40,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:40,613 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:40,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:40,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:40,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 57013188, now seen corresponding path program 3 times [2019-12-27 08:41:40,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:40,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388511715] [2019-12-27 08:41:40,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:40,954 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 08:41:40,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388511715] [2019-12-27 08:41:40,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660666426] [2019-12-27 08:41:40,955 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 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 08:41:41,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 08:41:41,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:41,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 08:41:41,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:41,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:41,072 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 08:41:41,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:41,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 08:41:41,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953032926] [2019-12-27 08:41:41,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:41:41,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:41:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:41:41,074 INFO L87 Difference]: Start difference. First operand 346 states and 825 transitions. Second operand 11 states. [2019-12-27 08:41:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:41,282 INFO L93 Difference]: Finished difference Result 677 states and 1585 transitions. [2019-12-27 08:41:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:41:41,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-27 08:41:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:41,286 INFO L225 Difference]: With dead ends: 677 [2019-12-27 08:41:41,286 INFO L226 Difference]: Without dead ends: 464 [2019-12-27 08:41:41,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:41:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-27 08:41:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 365. [2019-12-27 08:41:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-27 08:41:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 863 transitions. [2019-12-27 08:41:41,300 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 863 transitions. Word has length 42 [2019-12-27 08:41:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:41,300 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 863 transitions. [2019-12-27 08:41:41,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 08:41:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 863 transitions. [2019-12-27 08:41:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 08:41:41,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:41,302 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:41,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:41,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2041820769, now seen corresponding path program 4 times [2019-12-27 08:41:41,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:41,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359104341] [2019-12-27 08:41:41,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:41,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359104341] [2019-12-27 08:41:41,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917539278] [2019-12-27 08:41:41,619 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 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 08:41:41,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:41:41,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:41,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 08:41:41,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:41,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:41,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:41,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:41,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 08:41:41,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614661810] [2019-12-27 08:41:41,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:41:41,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:41:41,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:41:41,705 INFO L87 Difference]: Start difference. First operand 365 states and 863 transitions. Second operand 12 states. [2019-12-27 08:41:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:41,902 INFO L93 Difference]: Finished difference Result 709 states and 1649 transitions. [2019-12-27 08:41:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:41:41,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-12-27 08:41:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:41,906 INFO L225 Difference]: With dead ends: 709 [2019-12-27 08:41:41,906 INFO L226 Difference]: Without dead ends: 496 [2019-12-27 08:41:41,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:41:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-27 08:41:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 378. [2019-12-27 08:41:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 08:41:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 889 transitions. [2019-12-27 08:41:41,918 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 889 transitions. Word has length 46 [2019-12-27 08:41:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:41,919 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 889 transitions. [2019-12-27 08:41:41,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:41:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 889 transitions. [2019-12-27 08:41:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 08:41:41,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:41,920 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:42,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:42,129 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 216399870, now seen corresponding path program 5 times [2019-12-27 08:41:42,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:42,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356533623] [2019-12-27 08:41:42,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:42,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356533623] [2019-12-27 08:41:42,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390783572] [2019-12-27 08:41:42,269 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 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 08:41:42,339 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 08:41:42,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:42,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 08:41:42,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:42,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:42,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:42,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:42,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 08:41:42,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270319763] [2019-12-27 08:41:42,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:41:42,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:41:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:41:42,394 INFO L87 Difference]: Start difference. First operand 378 states and 889 transitions. Second operand 13 states. [2019-12-27 08:41:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:42,669 INFO L93 Difference]: Finished difference Result 741 states and 1713 transitions. [2019-12-27 08:41:42,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:41:42,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-12-27 08:41:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:42,673 INFO L225 Difference]: With dead ends: 741 [2019-12-27 08:41:42,674 INFO L226 Difference]: Without dead ends: 528 [2019-12-27 08:41:42,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:41:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-27 08:41:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2019-12-27 08:41:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 08:41:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 927 transitions. [2019-12-27 08:41:42,703 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 927 transitions. Word has length 50 [2019-12-27 08:41:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:42,703 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 927 transitions. [2019-12-27 08:41:42,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:41:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 927 transitions. [2019-12-27 08:41:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:41:42,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:42,705 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:42,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:42,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:42,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1337338469, now seen corresponding path program 6 times [2019-12-27 08:41:42,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:42,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875624089] [2019-12-27 08:41:42,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:43,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875624089] [2019-12-27 08:41:43,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888144956] [2019-12-27 08:41:43,064 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 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 08:41:43,117 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 08:41:43,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:43,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 08:41:43,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:43,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:43,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:43,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:43,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:43,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 08:41:43,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434089813] [2019-12-27 08:41:43,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:41:43,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:43,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:41:43,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:41:43,150 INFO L87 Difference]: Start difference. First operand 397 states and 927 transitions. Second operand 14 states. [2019-12-27 08:41:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:43,433 INFO L93 Difference]: Finished difference Result 801 states and 1833 transitions. [2019-12-27 08:41:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:41:43,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 08:41:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:43,438 INFO L225 Difference]: With dead ends: 801 [2019-12-27 08:41:43,438 INFO L226 Difference]: Without dead ends: 612 [2019-12-27 08:41:43,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:41:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-27 08:41:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 572. [2019-12-27 08:41:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-27 08:41:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1281 transitions. [2019-12-27 08:41:43,453 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1281 transitions. Word has length 54 [2019-12-27 08:41:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:43,454 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1281 transitions. [2019-12-27 08:41:43,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:41:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1281 transitions. [2019-12-27 08:41:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 08:41:43,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:43,455 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:43,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:43,659 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1662726712, now seen corresponding path program 7 times [2019-12-27 08:41:43,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:43,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770378638] [2019-12-27 08:41:43,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:43,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770378638] [2019-12-27 08:41:43,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772596129] [2019-12-27 08:41:43,804 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 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 08:41:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:43,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 08:41:43,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:43,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:43,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:43,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:43,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 08:41:43,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917612493] [2019-12-27 08:41:43,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 08:41:43,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 08:41:43,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:41:43,923 INFO L87 Difference]: Start difference. First operand 572 states and 1281 transitions. Second operand 15 states. [2019-12-27 08:41:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:44,246 INFO L93 Difference]: Finished difference Result 829 states and 1889 transitions. [2019-12-27 08:41:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 08:41:44,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-27 08:41:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:44,250 INFO L225 Difference]: With dead ends: 829 [2019-12-27 08:41:44,250 INFO L226 Difference]: Without dead ends: 616 [2019-12-27 08:41:44,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:41:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-12-27 08:41:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2019-12-27 08:41:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 08:41:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1345 transitions. [2019-12-27 08:41:44,269 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1345 transitions. Word has length 58 [2019-12-27 08:41:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:44,269 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1345 transitions. [2019-12-27 08:41:44,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 08:41:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1345 transitions. [2019-12-27 08:41:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 08:41:44,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:44,272 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:44,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:44,476 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash -774759723, now seen corresponding path program 8 times [2019-12-27 08:41:44,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:44,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351172414] [2019-12-27 08:41:44,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:44,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351172414] [2019-12-27 08:41:44,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257019690] [2019-12-27 08:41:44,640 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 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 08:41:44,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:41:44,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:44,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 08:41:44,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:44,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:44,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 08:41:44,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016155143] [2019-12-27 08:41:44,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:41:44,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:44,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:41:44,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:41:44,755 INFO L87 Difference]: Start difference. First operand 604 states and 1345 transitions. Second operand 16 states. [2019-12-27 08:41:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:45,347 INFO L93 Difference]: Finished difference Result 987 states and 2254 transitions. [2019-12-27 08:41:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:41:45,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2019-12-27 08:41:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:45,351 INFO L225 Difference]: With dead ends: 987 [2019-12-27 08:41:45,352 INFO L226 Difference]: Without dead ends: 692 [2019-12-27 08:41:45,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-12-27 08:41:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-27 08:41:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 636. [2019-12-27 08:41:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-27 08:41:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1409 transitions. [2019-12-27 08:41:45,369 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1409 transitions. Word has length 62 [2019-12-27 08:41:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:45,370 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1409 transitions. [2019-12-27 08:41:45,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:41:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1409 transitions. [2019-12-27 08:41:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:41:45,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:45,371 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:45,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:45,584 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1451259278, now seen corresponding path program 9 times [2019-12-27 08:41:45,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:45,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960859506] [2019-12-27 08:41:45,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:45,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960859506] [2019-12-27 08:41:45,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295399271] [2019-12-27 08:41:45,789 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 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 08:41:45,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 08:41:45,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:45,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 08:41:45,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:45,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:45,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:45,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:45,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 08:41:45,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854787638] [2019-12-27 08:41:45,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 08:41:45,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 08:41:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:41:45,892 INFO L87 Difference]: Start difference. First operand 636 states and 1409 transitions. Second operand 17 states. [2019-12-27 08:41:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:46,256 INFO L93 Difference]: Finished difference Result 893 states and 2017 transitions. [2019-12-27 08:41:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:41:46,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 08:41:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:46,260 INFO L225 Difference]: With dead ends: 893 [2019-12-27 08:41:46,260 INFO L226 Difference]: Without dead ends: 680 [2019-12-27 08:41:46,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:41:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-12-27 08:41:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 668. [2019-12-27 08:41:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-12-27 08:41:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1473 transitions. [2019-12-27 08:41:46,278 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1473 transitions. Word has length 66 [2019-12-27 08:41:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:46,278 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 1473 transitions. [2019-12-27 08:41:46,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 08:41:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1473 transitions. [2019-12-27 08:41:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 08:41:46,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:46,280 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:46,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:46,485 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash -188316145, now seen corresponding path program 10 times [2019-12-27 08:41:46,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:46,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546202529] [2019-12-27 08:41:46,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:46,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546202529] [2019-12-27 08:41:46,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106693119] [2019-12-27 08:41:46,677 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 08:41:46,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:41:46,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:46,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 08:41:46,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:46,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:46,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 08:41:46,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603704828] [2019-12-27 08:41:46,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 08:41:46,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 08:41:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:41:46,782 INFO L87 Difference]: Start difference. First operand 668 states and 1473 transitions. Second operand 18 states. [2019-12-27 08:41:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:47,235 INFO L93 Difference]: Finished difference Result 1051 states and 2382 transitions. [2019-12-27 08:41:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 08:41:47,235 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2019-12-27 08:41:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:47,239 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 08:41:47,239 INFO L226 Difference]: Without dead ends: 756 [2019-12-27 08:41:47,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 08:41:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-12-27 08:41:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 700. [2019-12-27 08:41:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-12-27 08:41:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1537 transitions. [2019-12-27 08:41:47,257 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1537 transitions. Word has length 70 [2019-12-27 08:41:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:47,257 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 1537 transitions. [2019-12-27 08:41:47,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 08:41:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1537 transitions. [2019-12-27 08:41:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 08:41:47,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:47,259 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:47,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:47,467 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1770850476, now seen corresponding path program 11 times [2019-12-27 08:41:47,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:47,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823216882] [2019-12-27 08:41:47,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:47,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823216882] [2019-12-27 08:41:47,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379288640] [2019-12-27 08:41:47,644 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 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 08:41:47,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 08:41:47,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:47,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 08:41:47,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:47,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:47,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:47,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:47,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 08:41:47,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491982761] [2019-12-27 08:41:47,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:41:47,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:41:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:41:47,748 INFO L87 Difference]: Start difference. First operand 700 states and 1537 transitions. Second operand 19 states. [2019-12-27 08:41:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:48,168 INFO L93 Difference]: Finished difference Result 973 states and 2177 transitions. [2019-12-27 08:41:48,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 08:41:48,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2019-12-27 08:41:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:48,172 INFO L225 Difference]: With dead ends: 973 [2019-12-27 08:41:48,173 INFO L226 Difference]: Without dead ends: 784 [2019-12-27 08:41:48,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 08:41:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-27 08:41:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 517. [2019-12-27 08:41:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-12-27 08:41:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1167 transitions. [2019-12-27 08:41:48,198 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1167 transitions. Word has length 74 [2019-12-27 08:41:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:48,198 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 1167 transitions. [2019-12-27 08:41:48,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:41:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1167 transitions. [2019-12-27 08:41:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 08:41:48,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:48,200 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:48,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:48,404 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash 362878793, now seen corresponding path program 12 times [2019-12-27 08:41:48,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:48,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274405817] [2019-12-27 08:41:48,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:48,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274405817] [2019-12-27 08:41:48,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947628032] [2019-12-27 08:41:48,683 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 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 08:41:48,777 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 08:41:48,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:48,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 08:41:48,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:48,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:48,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:48,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:48,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 08:41:48,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557018844] [2019-12-27 08:41:48,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 08:41:48,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 08:41:48,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:41:48,847 INFO L87 Difference]: Start difference. First operand 517 states and 1167 transitions. Second operand 20 states. [2019-12-27 08:41:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:49,330 INFO L93 Difference]: Finished difference Result 1111 states and 2502 transitions. [2019-12-27 08:41:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 08:41:49,331 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2019-12-27 08:41:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:49,336 INFO L225 Difference]: With dead ends: 1111 [2019-12-27 08:41:49,336 INFO L226 Difference]: Without dead ends: 816 [2019-12-27 08:41:49,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 08:41:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-12-27 08:41:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 530. [2019-12-27 08:41:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-12-27 08:41:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1193 transitions. [2019-12-27 08:41:49,351 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1193 transitions. Word has length 78 [2019-12-27 08:41:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:49,351 INFO L462 AbstractCegarLoop]: Abstraction has 530 states and 1193 transitions. [2019-12-27 08:41:49,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 08:41:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1193 transitions. [2019-12-27 08:41:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 08:41:49,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:49,352 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:49,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:49,558 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash 314420454, now seen corresponding path program 13 times [2019-12-27 08:41:49,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:49,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935414043] [2019-12-27 08:41:49,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:49,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935414043] [2019-12-27 08:41:49,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536517651] [2019-12-27 08:41:49,791 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 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 08:41:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:49,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 08:41:49,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:49,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:49,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:49,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 08:41:49,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859306121] [2019-12-27 08:41:49,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 08:41:49,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:49,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 08:41:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 08:41:49,906 INFO L87 Difference]: Start difference. First operand 530 states and 1193 transitions. Second operand 21 states. [2019-12-27 08:41:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:50,438 INFO L93 Difference]: Finished difference Result 1143 states and 2566 transitions. [2019-12-27 08:41:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 08:41:50,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2019-12-27 08:41:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:50,443 INFO L225 Difference]: With dead ends: 1143 [2019-12-27 08:41:50,443 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 08:41:50,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=1109, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 08:41:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 08:41:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 796. [2019-12-27 08:41:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-27 08:41:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1729 transitions. [2019-12-27 08:41:50,459 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1729 transitions. Word has length 82 [2019-12-27 08:41:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:50,460 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1729 transitions. [2019-12-27 08:41:50,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 08:41:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1729 transitions. [2019-12-27 08:41:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 08:41:50,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:50,462 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:50,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:50,665 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 383504003, now seen corresponding path program 14 times [2019-12-27 08:41:50,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:50,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503032779] [2019-12-27 08:41:50,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:50,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503032779] [2019-12-27 08:41:50,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279464722] [2019-12-27 08:41:50,902 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 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 08:41:50,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:41:50,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:50,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 08:41:50,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:51,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:51,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 08:41:51,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797812336] [2019-12-27 08:41:51,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 08:41:51,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:51,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 08:41:51,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2019-12-27 08:41:51,021 INFO L87 Difference]: Start difference. First operand 796 states and 1729 transitions. Second operand 22 states. [2019-12-27 08:41:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:51,621 INFO L93 Difference]: Finished difference Result 1151 states and 2582 transitions. [2019-12-27 08:41:51,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 08:41:51,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2019-12-27 08:41:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:51,626 INFO L225 Difference]: With dead ends: 1151 [2019-12-27 08:41:51,626 INFO L226 Difference]: Without dead ends: 832 [2019-12-27 08:41:51,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 08:41:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-12-27 08:41:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 538. [2019-12-27 08:41:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-27 08:41:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1209 transitions. [2019-12-27 08:41:51,642 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1209 transitions. Word has length 86 [2019-12-27 08:41:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:51,643 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1209 transitions. [2019-12-27 08:41:51,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 08:41:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1209 transitions. [2019-12-27 08:41:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 08:41:51,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:51,645 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:51,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:51,849 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash -91523296, now seen corresponding path program 15 times [2019-12-27 08:41:51,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:51,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001276287] [2019-12-27 08:41:51,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:52,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001276287] [2019-12-27 08:41:52,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953645932] [2019-12-27 08:41:52,133 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 08:41:52,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 08:41:52,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:52,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 08:41:52,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:52,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:52,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:52,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:52,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:52,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 08:41:52,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149872003] [2019-12-27 08:41:52,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 08:41:52,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:52,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 08:41:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:41:52,259 INFO L87 Difference]: Start difference. First operand 538 states and 1209 transitions. Second operand 23 states. [2019-12-27 08:41:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:52,785 INFO L93 Difference]: Finished difference Result 1061 states and 2353 transitions. [2019-12-27 08:41:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 08:41:52,786 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2019-12-27 08:41:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:52,791 INFO L225 Difference]: With dead ends: 1061 [2019-12-27 08:41:52,791 INFO L226 Difference]: Without dead ends: 848 [2019-12-27 08:41:52,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=486, Invalid=1320, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 08:41:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-27 08:41:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 557. [2019-12-27 08:41:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-12-27 08:41:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1247 transitions. [2019-12-27 08:41:52,804 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1247 transitions. Word has length 90 [2019-12-27 08:41:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:52,804 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 1247 transitions. [2019-12-27 08:41:52,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 08:41:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1247 transitions. [2019-12-27 08:41:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 08:41:52,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:52,806 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:53,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:53,010 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1057969219, now seen corresponding path program 16 times [2019-12-27 08:41:53,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:53,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145925546] [2019-12-27 08:41:53,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:53,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145925546] [2019-12-27 08:41:53,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630700308] [2019-12-27 08:41:53,273 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 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 08:41:53,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:41:53,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:53,353 INFO L264 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 08:41:53,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:53,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:53,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:53,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 08:41:53,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372178768] [2019-12-27 08:41:53,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 08:41:53,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 08:41:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:41:53,405 INFO L87 Difference]: Start difference. First operand 557 states and 1247 transitions. Second operand 24 states. [2019-12-27 08:41:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:53,983 INFO L93 Difference]: Finished difference Result 1121 states and 2473 transitions. [2019-12-27 08:41:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 08:41:53,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2019-12-27 08:41:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:53,988 INFO L225 Difference]: With dead ends: 1121 [2019-12-27 08:41:53,988 INFO L226 Difference]: Without dead ends: 932 [2019-12-27 08:41:53,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=553, Invalid=1339, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 08:41:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-12-27 08:41:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 892. [2019-12-27 08:41:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-12-27 08:41:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1921 transitions. [2019-12-27 08:41:54,006 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1921 transitions. Word has length 94 [2019-12-27 08:41:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:54,006 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1921 transitions. [2019-12-27 08:41:54,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 08:41:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1921 transitions. [2019-12-27 08:41:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 08:41:54,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:54,010 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:54,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:54,213 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:54,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:54,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1550870362, now seen corresponding path program 17 times [2019-12-27 08:41:54,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:54,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026876798] [2019-12-27 08:41:54,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:54,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026876798] [2019-12-27 08:41:54,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45501813] [2019-12-27 08:41:54,487 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:54,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-27 08:41:54,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:54,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 08:41:54,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:54,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:54,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 08:41:54,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274054579] [2019-12-27 08:41:54,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 08:41:54,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 08:41:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:41:54,598 INFO L87 Difference]: Start difference. First operand 892 states and 1921 transitions. Second operand 25 states. [2019-12-27 08:41:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:55,268 INFO L93 Difference]: Finished difference Result 1149 states and 2529 transitions. [2019-12-27 08:41:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 08:41:55,269 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2019-12-27 08:41:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:55,276 INFO L225 Difference]: With dead ends: 1149 [2019-12-27 08:41:55,276 INFO L226 Difference]: Without dead ends: 936 [2019-12-27 08:41:55,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=647, Invalid=1515, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 08:41:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-27 08:41:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 924. [2019-12-27 08:41:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-12-27 08:41:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1985 transitions. [2019-12-27 08:41:55,304 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1985 transitions. Word has length 98 [2019-12-27 08:41:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:55,304 INFO L462 AbstractCegarLoop]: Abstraction has 924 states and 1985 transitions. [2019-12-27 08:41:55,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 08:41:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1985 transitions. [2019-12-27 08:41:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 08:41:55,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:55,307 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:55,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:55,520 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1034309897, now seen corresponding path program 18 times [2019-12-27 08:41:55,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:55,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169052397] [2019-12-27 08:41:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169052397] [2019-12-27 08:41:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091789533] [2019-12-27 08:41:55,840 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:55,910 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-12-27 08:41:55,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:55,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 08:41:55,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:55,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:55,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:55,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 08:41:55,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003251303] [2019-12-27 08:41:55,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 08:41:55,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 08:41:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-27 08:41:55,965 INFO L87 Difference]: Start difference. First operand 924 states and 1985 transitions. Second operand 26 states. [2019-12-27 08:41:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:56,634 INFO L93 Difference]: Finished difference Result 1279 states and 2838 transitions. [2019-12-27 08:41:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 08:41:56,634 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-12-27 08:41:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:56,638 INFO L225 Difference]: With dead ends: 1279 [2019-12-27 08:41:56,639 INFO L226 Difference]: Without dead ends: 960 [2019-12-27 08:41:56,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 08:41:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-12-27 08:41:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 602. [2019-12-27 08:41:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 08:41:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1337 transitions. [2019-12-27 08:41:56,650 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1337 transitions. Word has length 102 [2019-12-27 08:41:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:56,650 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1337 transitions. [2019-12-27 08:41:56,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 08:41:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1337 transitions. [2019-12-27 08:41:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-27 08:41:56,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:56,652 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:56,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:56,853 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1508277652, now seen corresponding path program 19 times [2019-12-27 08:41:56,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:56,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441580547] [2019-12-27 08:41:56,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:57,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441580547] [2019-12-27 08:41:57,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489249982] [2019-12-27 08:41:57,195 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:57,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 08:41:57,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:57,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:57,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:57,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:57,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 08:41:57,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494958488] [2019-12-27 08:41:57,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 08:41:57,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 08:41:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 08:41:57,317 INFO L87 Difference]: Start difference. First operand 602 states and 1337 transitions. Second operand 27 states. [2019-12-27 08:41:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:57,992 INFO L93 Difference]: Finished difference Result 1189 states and 2609 transitions. [2019-12-27 08:41:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 08:41:57,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2019-12-27 08:41:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:57,996 INFO L225 Difference]: With dead ends: 1189 [2019-12-27 08:41:57,996 INFO L226 Difference]: Without dead ends: 976 [2019-12-27 08:41:57,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 08:41:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-27 08:41:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 621. [2019-12-27 08:41:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-12-27 08:41:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1375 transitions. [2019-12-27 08:41:58,009 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1375 transitions. Word has length 106 [2019-12-27 08:41:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:58,010 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 1375 transitions. [2019-12-27 08:41:58,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 08:41:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1375 transitions. [2019-12-27 08:41:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-27 08:41:58,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:58,012 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:58,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:58,215 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1349461967, now seen corresponding path program 20 times [2019-12-27 08:41:58,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:58,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072727706] [2019-12-27 08:41:58,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:58,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072727706] [2019-12-27 08:41:58,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818450581] [2019-12-27 08:41:58,551 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:58,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:41:58,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:58,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 08:41:58,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:58,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:58,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:58,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 08:41:58,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154446306] [2019-12-27 08:41:58,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 08:41:58,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:58,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 08:41:58,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-27 08:41:58,688 INFO L87 Difference]: Start difference. First operand 621 states and 1375 transitions. Second operand 28 states. [2019-12-27 08:41:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:59,394 INFO L93 Difference]: Finished difference Result 1221 states and 2673 transitions. [2019-12-27 08:41:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 08:41:59,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 110 [2019-12-27 08:41:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:59,400 INFO L225 Difference]: With dead ends: 1221 [2019-12-27 08:41:59,400 INFO L226 Difference]: Without dead ends: 1008 [2019-12-27 08:41:59,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 08:41:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-27 08:41:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 634. [2019-12-27 08:41:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-12-27 08:41:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1401 transitions. [2019-12-27 08:41:59,414 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1401 transitions. Word has length 110 [2019-12-27 08:41:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:59,414 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 1401 transitions. [2019-12-27 08:41:59,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 08:41:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1401 transitions. [2019-12-27 08:41:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 08:41:59,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:59,416 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:59,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:59,620 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:59,621 INFO L82 PathProgramCache]: Analyzing trace with hash -93865522, now seen corresponding path program 21 times [2019-12-27 08:41:59,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:59,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628725881] [2019-12-27 08:41:59,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:00,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628725881] [2019-12-27 08:42:00,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997813435] [2019-12-27 08:42:00,098 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:00,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-27 08:42:00,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:00,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 08:42:00,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:00,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:00,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:00,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:00,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:00,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 08:42:00,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802372384] [2019-12-27 08:42:00,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 08:42:00,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 08:42:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-12-27 08:42:00,308 INFO L87 Difference]: Start difference. First operand 634 states and 1401 transitions. Second operand 29 states. [2019-12-27 08:42:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:01,163 INFO L93 Difference]: Finished difference Result 1253 states and 2737 transitions. [2019-12-27 08:42:01,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 08:42:01,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 114 [2019-12-27 08:42:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:01,169 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 08:42:01,169 INFO L226 Difference]: Without dead ends: 1040 [2019-12-27 08:42:01,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=804, Invalid=2166, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 08:42:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-12-27 08:42:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 653. [2019-12-27 08:42:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-12-27 08:42:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1439 transitions. [2019-12-27 08:42:01,184 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1439 transitions. Word has length 114 [2019-12-27 08:42:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:01,184 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 1439 transitions. [2019-12-27 08:42:01,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 08:42:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1439 transitions. [2019-12-27 08:42:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-27 08:42:01,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:01,187 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:01,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:01,391 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash 51390315, now seen corresponding path program 22 times [2019-12-27 08:42:01,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:01,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849022294] [2019-12-27 08:42:01,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:01,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849022294] [2019-12-27 08:42:01,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814486822] [2019-12-27 08:42:01,768 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:01,837 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:42:01,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:01,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 08:42:01,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:01,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:01,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:01,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:01,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 08:42:01,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521056317] [2019-12-27 08:42:01,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 08:42:01,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:01,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 08:42:01,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-12-27 08:42:01,887 INFO L87 Difference]: Start difference. First operand 653 states and 1439 transitions. Second operand 30 states. [2019-12-27 08:42:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:02,693 INFO L93 Difference]: Finished difference Result 1313 states and 2857 transitions. [2019-12-27 08:42:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 08:42:02,693 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 118 [2019-12-27 08:42:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:02,699 INFO L225 Difference]: With dead ends: 1313 [2019-12-27 08:42:02,699 INFO L226 Difference]: Without dead ends: 1124 [2019-12-27 08:42:02,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=910, Invalid=2170, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 08:42:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-12-27 08:42:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1084. [2019-12-27 08:42:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-12-27 08:42:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 2305 transitions. [2019-12-27 08:42:02,715 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 2305 transitions. Word has length 118 [2019-12-27 08:42:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:02,715 INFO L462 AbstractCegarLoop]: Abstraction has 1084 states and 2305 transitions. [2019-12-27 08:42:02,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 08:42:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 2305 transitions. [2019-12-27 08:42:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-27 08:42:02,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:02,718 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:02,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:02,922 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash 728636424, now seen corresponding path program 23 times [2019-12-27 08:42:02,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:02,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411793552] [2019-12-27 08:42:02,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411793552] [2019-12-27 08:42:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236687528] [2019-12-27 08:42:03,365 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:03,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-27 08:42:03,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:03,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 08:42:03,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:03,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:03,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:03,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 08:42:03,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257253913] [2019-12-27 08:42:03,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 08:42:03,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:03,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 08:42:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 08:42:03,493 INFO L87 Difference]: Start difference. First operand 1084 states and 2305 transitions. Second operand 31 states. [2019-12-27 08:42:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:04,347 INFO L93 Difference]: Finished difference Result 1341 states and 2913 transitions. [2019-12-27 08:42:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 08:42:04,347 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 122 [2019-12-27 08:42:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:04,353 INFO L225 Difference]: With dead ends: 1341 [2019-12-27 08:42:04,353 INFO L226 Difference]: Without dead ends: 1128 [2019-12-27 08:42:04,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1031, Invalid=2391, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 08:42:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-27 08:42:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1116. [2019-12-27 08:42:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-12-27 08:42:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2369 transitions. [2019-12-27 08:42:04,387 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 2369 transitions. Word has length 122 [2019-12-27 08:42:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:04,388 INFO L462 AbstractCegarLoop]: Abstraction has 1116 states and 2369 transitions. [2019-12-27 08:42:04,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 08:42:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 2369 transitions. [2019-12-27 08:42:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-27 08:42:04,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:04,391 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:04,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:04,594 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 491887781, now seen corresponding path program 24 times [2019-12-27 08:42:04,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:04,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004368860] [2019-12-27 08:42:04,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:05,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004368860] [2019-12-27 08:42:05,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981217459] [2019-12-27 08:42:05,149 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:05,240 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-12-27 08:42:05,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:05,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 08:42:05,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:05,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:05,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:05,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:05,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 08:42:05,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030394033] [2019-12-27 08:42:05,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 08:42:05,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 08:42:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:42:05,300 INFO L87 Difference]: Start difference. First operand 1116 states and 2369 transitions. Second operand 32 states. [2019-12-27 08:42:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:06,330 INFO L93 Difference]: Finished difference Result 1499 states and 3278 transitions. [2019-12-27 08:42:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 08:42:06,331 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-12-27 08:42:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:06,336 INFO L225 Difference]: With dead ends: 1499 [2019-12-27 08:42:06,336 INFO L226 Difference]: Without dead ends: 1204 [2019-12-27 08:42:06,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1010, Invalid=2772, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 08:42:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-12-27 08:42:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1148. [2019-12-27 08:42:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-12-27 08:42:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 2433 transitions. [2019-12-27 08:42:06,356 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 2433 transitions. Word has length 126 [2019-12-27 08:42:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:06,356 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 2433 transitions. [2019-12-27 08:42:06,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 08:42:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2433 transitions. [2019-12-27 08:42:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-27 08:42:06,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:06,359 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:06,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:06,563 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:06,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1066163134, now seen corresponding path program 25 times [2019-12-27 08:42:06,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:06,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942024521] [2019-12-27 08:42:06,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:07,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942024521] [2019-12-27 08:42:07,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961008900] [2019-12-27 08:42:07,229 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:07,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 08:42:07,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:07,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:07,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:07,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:07,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 08:42:07,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743064819] [2019-12-27 08:42:07,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 08:42:07,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 08:42:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 08:42:07,371 INFO L87 Difference]: Start difference. First operand 1148 states and 2433 transitions. Second operand 33 states. [2019-12-27 08:42:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:08,454 INFO L93 Difference]: Finished difference Result 1405 states and 3041 transitions. [2019-12-27 08:42:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 08:42:08,455 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2019-12-27 08:42:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:08,457 INFO L225 Difference]: With dead ends: 1405 [2019-12-27 08:42:08,457 INFO L226 Difference]: Without dead ends: 1192 [2019-12-27 08:42:08,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1179, Invalid=2727, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 08:42:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-27 08:42:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1180. [2019-12-27 08:42:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-27 08:42:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2497 transitions. [2019-12-27 08:42:08,475 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2497 transitions. Word has length 130 [2019-12-27 08:42:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:08,475 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 2497 transitions. [2019-12-27 08:42:08,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 08:42:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2497 transitions. [2019-12-27 08:42:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-27 08:42:08,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:08,478 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:08,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:08,680 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1154430943, now seen corresponding path program 26 times [2019-12-27 08:42:08,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:08,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158384078] [2019-12-27 08:42:08,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:09,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158384078] [2019-12-27 08:42:09,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466703954] [2019-12-27 08:42:09,389 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:09,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:42:09,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:09,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 08:42:09,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:09,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:09,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 08:42:09,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045517006] [2019-12-27 08:42:09,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 08:42:09,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 08:42:09,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 08:42:09,527 INFO L87 Difference]: Start difference. First operand 1180 states and 2497 transitions. Second operand 34 states. [2019-12-27 08:42:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:10,589 INFO L93 Difference]: Finished difference Result 1563 states and 3406 transitions. [2019-12-27 08:42:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 08:42:10,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2019-12-27 08:42:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:10,592 INFO L225 Difference]: With dead ends: 1563 [2019-12-27 08:42:10,592 INFO L226 Difference]: Without dead ends: 1268 [2019-12-27 08:42:10,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1148, Invalid=3142, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 08:42:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2019-12-27 08:42:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1212. [2019-12-27 08:42:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-12-27 08:42:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 2561 transitions. [2019-12-27 08:42:10,615 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 2561 transitions. Word has length 134 [2019-12-27 08:42:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:10,616 INFO L462 AbstractCegarLoop]: Abstraction has 1212 states and 2561 transitions. [2019-12-27 08:42:10,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 08:42:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 2561 transitions. [2019-12-27 08:42:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 08:42:10,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:10,618 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:10,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:10,822 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:10,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1928483452, now seen corresponding path program 27 times [2019-12-27 08:42:10,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:10,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615347418] [2019-12-27 08:42:10,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:11,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615347418] [2019-12-27 08:42:11,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753264758] [2019-12-27 08:42:11,416 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:11,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-27 08:42:11,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:11,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 08:42:11,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:11,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:11,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:11,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:11,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:11,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 08:42:11,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793397403] [2019-12-27 08:42:11,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 08:42:11,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 08:42:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 08:42:11,584 INFO L87 Difference]: Start difference. First operand 1212 states and 2561 transitions. Second operand 35 states. [2019-12-27 08:42:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:12,643 INFO L93 Difference]: Finished difference Result 1485 states and 3201 transitions. [2019-12-27 08:42:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 08:42:12,643 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-12-27 08:42:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:12,647 INFO L225 Difference]: With dead ends: 1485 [2019-12-27 08:42:12,647 INFO L226 Difference]: Without dead ends: 1296 [2019-12-27 08:42:12,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1203, Invalid=3219, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 08:42:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-12-27 08:42:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 773. [2019-12-27 08:42:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 08:42:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1679 transitions. [2019-12-27 08:42:12,669 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1679 transitions. Word has length 138 [2019-12-27 08:42:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:12,669 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1679 transitions. [2019-12-27 08:42:12,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 08:42:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1679 transitions. [2019-12-27 08:42:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-27 08:42:12,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:12,671 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:12,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:12,876 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1509754599, now seen corresponding path program 28 times [2019-12-27 08:42:12,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:12,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560074443] [2019-12-27 08:42:12,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:13,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560074443] [2019-12-27 08:42:13,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28115466] [2019-12-27 08:42:13,630 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:13,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:42:13,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:13,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 08:42:13,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:13,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:13,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 08:42:13,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689631800] [2019-12-27 08:42:13,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 08:42:13,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 08:42:13,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 08:42:13,838 INFO L87 Difference]: Start difference. First operand 773 states and 1679 transitions. Second operand 36 states. [2019-12-27 08:42:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:14,940 INFO L93 Difference]: Finished difference Result 1623 states and 3526 transitions. [2019-12-27 08:42:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 08:42:14,940 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 142 [2019-12-27 08:42:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:14,943 INFO L225 Difference]: With dead ends: 1623 [2019-12-27 08:42:14,943 INFO L226 Difference]: Without dead ends: 1280 [2019-12-27 08:42:14,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1367, Invalid=3325, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 08:42:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-27 08:42:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 762. [2019-12-27 08:42:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-12-27 08:42:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1657 transitions. [2019-12-27 08:42:14,957 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1657 transitions. Word has length 142 [2019-12-27 08:42:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:14,958 INFO L462 AbstractCegarLoop]: Abstraction has 762 states and 1657 transitions. [2019-12-27 08:42:14,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 08:42:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1657 transitions. [2019-12-27 08:42:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-27 08:42:14,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:14,960 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:15,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:15,164 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -496752970, now seen corresponding path program 29 times [2019-12-27 08:42:15,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:15,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186445324] [2019-12-27 08:42:15,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:15,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186445324] [2019-12-27 08:42:15,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785214509] [2019-12-27 08:42:15,719 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:15,806 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-12-27 08:42:15,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:15,808 INFO L264 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 08:42:15,809 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:15,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:15,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:15,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 08:42:15,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218693515] [2019-12-27 08:42:15,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 08:42:15,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 08:42:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 08:42:15,891 INFO L87 Difference]: Start difference. First operand 762 states and 1657 transitions. Second operand 37 states. [2019-12-27 08:42:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:17,007 INFO L93 Difference]: Finished difference Result 1509 states and 3249 transitions. [2019-12-27 08:42:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 08:42:17,007 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 146 [2019-12-27 08:42:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:17,010 INFO L225 Difference]: With dead ends: 1509 [2019-12-27 08:42:17,011 INFO L226 Difference]: Without dead ends: 1296 [2019-12-27 08:42:17,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1505, Invalid=3465, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 08:42:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-12-27 08:42:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 781. [2019-12-27 08:42:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-27 08:42:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1695 transitions. [2019-12-27 08:42:17,028 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1695 transitions. Word has length 146 [2019-12-27 08:42:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:17,028 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1695 transitions. [2019-12-27 08:42:17,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 08:42:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1695 transitions. [2019-12-27 08:42:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-27 08:42:17,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:17,030 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:17,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:17,234 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1399251027, now seen corresponding path program 30 times [2019-12-27 08:42:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:17,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910877119] [2019-12-27 08:42:17,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:17,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910877119] [2019-12-27 08:42:17,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437585115] [2019-12-27 08:42:17,729 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:17,826 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-27 08:42:17,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:17,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 08:42:17,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:17,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:17,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 08:42:17,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713514495] [2019-12-27 08:42:17,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 08:42:17,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 08:42:17,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 08:42:17,889 INFO L87 Difference]: Start difference. First operand 781 states and 1695 transitions. Second operand 38 states. [2019-12-27 08:42:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:18,999 INFO L93 Difference]: Finished difference Result 1541 states and 3313 transitions. [2019-12-27 08:42:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 08:42:19,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 150 [2019-12-27 08:42:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:19,013 INFO L225 Difference]: With dead ends: 1541 [2019-12-27 08:42:19,014 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 08:42:19,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=3813, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 08:42:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 08:42:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 794. [2019-12-27 08:42:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-27 08:42:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1721 transitions. [2019-12-27 08:42:19,031 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1721 transitions. Word has length 150 [2019-12-27 08:42:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:19,031 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1721 transitions. [2019-12-27 08:42:19,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 08:42:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1721 transitions. [2019-12-27 08:42:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-27 08:42:19,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:19,033 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:19,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:19,237 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:19,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1807539984, now seen corresponding path program 31 times [2019-12-27 08:42:19,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:19,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774487391] [2019-12-27 08:42:19,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:19,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774487391] [2019-12-27 08:42:19,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512923575] [2019-12-27 08:42:19,773 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:19,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 08:42:19,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:19,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:19,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:19,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:19,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 08:42:19,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536089759] [2019-12-27 08:42:19,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 08:42:19,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:19,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 08:42:19,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:42:19,918 INFO L87 Difference]: Start difference. First operand 794 states and 1721 transitions. Second operand 39 states. [2019-12-27 08:42:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:21,257 INFO L93 Difference]: Finished difference Result 1573 states and 3377 transitions. [2019-12-27 08:42:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 08:42:21,257 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2019-12-27 08:42:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:21,259 INFO L225 Difference]: With dead ends: 1573 [2019-12-27 08:42:21,259 INFO L226 Difference]: Without dead ends: 1360 [2019-12-27 08:42:21,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1683, Invalid=3867, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 08:42:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-12-27 08:42:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 813. [2019-12-27 08:42:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-27 08:42:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1759 transitions. [2019-12-27 08:42:21,272 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1759 transitions. Word has length 154 [2019-12-27 08:42:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:21,272 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1759 transitions. [2019-12-27 08:42:21,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 08:42:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1759 transitions. [2019-12-27 08:42:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-27 08:42:21,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:21,274 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:21,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:21,477 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1165290893, now seen corresponding path program 32 times [2019-12-27 08:42:21,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:21,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830822307] [2019-12-27 08:42:21,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 1057 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:22,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830822307] [2019-12-27 08:42:22,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201740308] [2019-12-27 08:42:22,162 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:22,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:42:22,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:22,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 08:42:22,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:22,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:22,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 1057 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:22,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:22,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 08:42:22,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124889562] [2019-12-27 08:42:22,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 08:42:22,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:22,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 08:42:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 08:42:22,306 INFO L87 Difference]: Start difference. First operand 813 states and 1759 transitions. Second operand 40 states. [2019-12-27 08:42:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:23,516 INFO L93 Difference]: Finished difference Result 1633 states and 3497 transitions. [2019-12-27 08:42:23,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 08:42:23,517 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 158 [2019-12-27 08:42:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:23,519 INFO L225 Difference]: With dead ends: 1633 [2019-12-27 08:42:23,519 INFO L226 Difference]: Without dead ends: 1444 [2019-12-27 08:42:23,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1608, Invalid=4244, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 08:42:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2019-12-27 08:42:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1404. [2019-12-27 08:42:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-27 08:42:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2945 transitions. [2019-12-27 08:42:23,541 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2945 transitions. Word has length 158 [2019-12-27 08:42:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:23,541 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 2945 transitions. [2019-12-27 08:42:23,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 08:42:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2945 transitions. [2019-12-27 08:42:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-27 08:42:23,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:23,543 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:23,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:23,744 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash -200720086, now seen corresponding path program 33 times [2019-12-27 08:42:23,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:23,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927467716] [2019-12-27 08:42:23,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:24,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927467716] [2019-12-27 08:42:24,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180995867] [2019-12-27 08:42:24,336 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:24,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-27 08:42:24,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:24,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 08:42:24,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:24,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:24,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:24,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:24,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:24,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 08:42:24,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149414851] [2019-12-27 08:42:24,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 08:42:24,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:24,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 08:42:24,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1253, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 08:42:24,504 INFO L87 Difference]: Start difference. First operand 1404 states and 2945 transitions. Second operand 41 states. [2019-12-27 08:42:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:25,732 INFO L93 Difference]: Finished difference Result 1661 states and 3553 transitions. [2019-12-27 08:42:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 08:42:25,732 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 162 [2019-12-27 08:42:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:25,735 INFO L225 Difference]: With dead ends: 1661 [2019-12-27 08:42:25,735 INFO L226 Difference]: Without dead ends: 1448 [2019-12-27 08:42:25,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1683, Invalid=4479, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 08:42:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-12-27 08:42:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1436. [2019-12-27 08:42:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-12-27 08:42:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 3009 transitions. [2019-12-27 08:42:25,757 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 3009 transitions. Word has length 162 [2019-12-27 08:42:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:25,757 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 3009 transitions. [2019-12-27 08:42:25,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 08:42:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 3009 transitions. [2019-12-27 08:42:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-27 08:42:25,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:25,760 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:25,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:25,963 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:25,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1520902343, now seen corresponding path program 34 times [2019-12-27 08:42:25,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:25,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407246636] [2019-12-27 08:42:25,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 0 proven. 1191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:26,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407246636] [2019-12-27 08:42:26,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647002797] [2019-12-27 08:42:26,566 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:26,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:42:26,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:26,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 08:42:26,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 0 proven. 1191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:26,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:26,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-12-27 08:42:26,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383793867] [2019-12-27 08:42:26,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 08:42:26,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 08:42:26,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 08:42:26,725 INFO L87 Difference]: Start difference. First operand 1436 states and 3009 transitions. Second operand 42 states. [2019-12-27 08:42:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:28,133 INFO L93 Difference]: Finished difference Result 1819 states and 3918 transitions. [2019-12-27 08:42:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 08:42:28,133 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 166 [2019-12-27 08:42:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:28,135 INFO L225 Difference]: With dead ends: 1819 [2019-12-27 08:42:28,135 INFO L226 Difference]: Without dead ends: 1524 [2019-12-27 08:42:28,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1904, Invalid=4576, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 08:42:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2019-12-27 08:42:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1468. [2019-12-27 08:42:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2019-12-27 08:42:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 3073 transitions. [2019-12-27 08:42:28,152 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 3073 transitions. Word has length 166 [2019-12-27 08:42:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:28,152 INFO L462 AbstractCegarLoop]: Abstraction has 1468 states and 3073 transitions. [2019-12-27 08:42:28,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 08:42:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 3073 transitions. [2019-12-27 08:42:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-27 08:42:28,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:28,154 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:28,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:28,355 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1395689316, now seen corresponding path program 35 times [2019-12-27 08:42:28,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:28,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267874605] [2019-12-27 08:42:28,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:28,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267874605] [2019-12-27 08:42:28,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981184429] [2019-12-27 08:42:28,935 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:29,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-27 08:42:29,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:29,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-27 08:42:29,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:29,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:29,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:29,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:29,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-27 08:42:29,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000066815] [2019-12-27 08:42:29,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 08:42:29,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 08:42:29,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 08:42:29,118 INFO L87 Difference]: Start difference. First operand 1468 states and 3073 transitions. Second operand 43 states. [2019-12-27 08:42:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:30,479 INFO L93 Difference]: Finished difference Result 1741 states and 3713 transitions. [2019-12-27 08:42:30,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 08:42:30,480 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2019-12-27 08:42:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:30,481 INFO L225 Difference]: With dead ends: 1741 [2019-12-27 08:42:30,481 INFO L226 Difference]: Without dead ends: 1552 [2019-12-27 08:42:30,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2069, Invalid=4737, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 08:42:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-12-27 08:42:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 901. [2019-12-27 08:42:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-27 08:42:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1935 transitions. [2019-12-27 08:42:30,495 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1935 transitions. Word has length 170 [2019-12-27 08:42:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:30,495 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1935 transitions. [2019-12-27 08:42:30,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 08:42:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1935 transitions. [2019-12-27 08:42:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-27 08:42:30,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:30,497 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:30,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:30,701 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1467447809, now seen corresponding path program 36 times [2019-12-27 08:42:30,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:30,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538471830] [2019-12-27 08:42:30,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:31,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538471830] [2019-12-27 08:42:31,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595572348] [2019-12-27 08:42:31,345 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:31,456 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-12-27 08:42:31,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:42:31,458 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-27 08:42:31,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:31,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:31,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:31,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:31,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:31,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-12-27 08:42:31,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104090612] [2019-12-27 08:42:31,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-27 08:42:31,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-27 08:42:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 08:42:31,539 INFO L87 Difference]: Start difference. First operand 901 states and 1935 transitions. Second operand 44 states. [2019-12-27 08:42:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:32,938 INFO L93 Difference]: Finished difference Result 1781 states and 3793 transitions. [2019-12-27 08:42:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 08:42:32,939 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2019-12-27 08:42:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:32,940 INFO L225 Difference]: With dead ends: 1781 [2019-12-27 08:42:32,940 INFO L226 Difference]: Without dead ends: 1544 [2019-12-27 08:42:32,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1967, Invalid=5173, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 08:42:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-27 08:42:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1516. [2019-12-27 08:42:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-12-27 08:42:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3169 transitions. [2019-12-27 08:42:32,957 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3169 transitions. Word has length 174 [2019-12-27 08:42:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:32,957 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 3169 transitions. [2019-12-27 08:42:32,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-27 08:42:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3169 transitions. [2019-12-27 08:42:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-27 08:42:32,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:32,959 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:33,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:33,160 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash -382536802, now seen corresponding path program 37 times [2019-12-27 08:42:33,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:33,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64199481] [2019-12-27 08:42:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:33,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64199481] [2019-12-27 08:42:33,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041011821] [2019-12-27 08:42:33,891 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:42:33,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-27 08:42:33,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:42:34,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:34,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:42:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:42:34,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:42:34,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-12-27 08:42:34,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253246280] [2019-12-27 08:42:34,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-27 08:42:34,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:42:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-27 08:42:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=1511, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 08:42:34,051 INFO L87 Difference]: Start difference. First operand 1516 states and 3169 transitions. Second operand 45 states. [2019-12-27 08:42:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:42:35,689 INFO L93 Difference]: Finished difference Result 1887 states and 4054 transitions. [2019-12-27 08:42:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 08:42:35,690 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 178 [2019-12-27 08:42:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:42:35,692 INFO L225 Difference]: With dead ends: 1887 [2019-12-27 08:42:35,692 INFO L226 Difference]: Without dead ends: 1592 [2019-12-27 08:42:35,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2287, Invalid=5369, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 08:42:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-12-27 08:42:35,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1548. [2019-12-27 08:42:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-12-27 08:42:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 3233 transitions. [2019-12-27 08:42:35,710 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 3233 transitions. Word has length 178 [2019-12-27 08:42:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:42:35,710 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 3233 transitions. [2019-12-27 08:42:35,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-27 08:42:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 3233 transitions. [2019-12-27 08:42:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-27 08:42:35,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:42:35,713 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:42:35,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:42:35,914 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:42:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:42:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -166276022, now seen corresponding path program 38 times [2019-12-27 08:42:35,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:42:35,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212114632] [2019-12-27 08:42:35,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:42:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:42:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:42:36,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:42:36,037 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:42:36,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:42:36 BasicIcfg [2019-12-27 08:42:36,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:42:36,227 INFO L168 Benchmark]: Toolchain (without parser) took 61163.67 ms. Allocated memory was 137.9 MB in the beginning and 634.4 MB in the end (delta: 496.5 MB). Free memory was 101.1 MB in the beginning and 115.6 MB in the end (delta: -14.5 MB). Peak memory consumption was 482.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,228 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.00 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 158.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.29 ms. Allocated memory is still 201.9 MB. Free memory was 158.9 MB in the beginning and 156.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,229 INFO L168 Benchmark]: Boogie Preprocessor took 26.87 ms. Allocated memory is still 201.9 MB. Free memory was 156.9 MB in the beginning and 155.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,230 INFO L168 Benchmark]: RCFGBuilder took 415.49 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 135.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,230 INFO L168 Benchmark]: TraceAbstraction took 59900.42 ms. Allocated memory was 201.9 MB in the beginning and 634.4 MB in the end (delta: 432.5 MB). Free memory was 135.8 MB in the beginning and 115.6 MB in the end (delta: 20.2 MB). Peak memory consumption was 452.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:42:36,232 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.00 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 158.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.29 ms. Allocated memory is still 201.9 MB. Free memory was 158.9 MB in the beginning and 156.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.87 ms. Allocated memory is still 201.9 MB. Free memory was 156.9 MB in the beginning and 155.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.49 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 135.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59900.42 ms. Allocated memory was 201.9 MB in the beginning and 634.4 MB in the end (delta: 432.5 MB). Free memory was 135.8 MB in the beginning and 115.6 MB in the end (delta: 20.2 MB). Peak memory consumption was 452.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L675] 0 int i = 3, j = 6; VAL [i=3, j=6] [L693] 0 pthread_t id1, id2; VAL [i=3, j=6] [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L677] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L685] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=10] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=11, k=10] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=13, k=12] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=14] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=14] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=19, k=18] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=18] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L677] COND TRUE 1 k < 20 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L685] COND TRUE 2 k < 20 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L697] 0 int condI = i >= (2*20 +6); [L700] 0 int condJ = j >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L702] COND TRUE 0 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L703] 0 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 59.6s, OverallIterations: 44, TraceHistogramMax: 20, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2504 SDtfs, 20095 SDslu, 30174 SDs, 0 SdLazy, 5687 SolverSat, 3265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5851 GetRequests, 3990 SyntacticMatches, 0 SemanticMatches, 1861 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20429 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1548occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 43 MinimizatonAttempts, 7188 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 8234 NumberOfCodeBlocks, 8234 NumberOfCodeBlocksAsserted, 284 NumberOfCheckSat, 7974 ConstructedInterpolants, 0 QuantifiedInterpolants, 2869510 SizeOfPredicates, 937 NumberOfNonLiveVariables, 9095 ConjunctsInSsa, 1071 ConjunctsInUnsatCore, 82 InterpolantComputations, 4 PerfectInterpolantSequences, 0/36596 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...