/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:30:36,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:30:36,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:30:36,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:30:36,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:30:36,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:30:36,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:30:36,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:30:36,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:30:36,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:30:36,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:30:36,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:30:36,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:30:36,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:30:36,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:30:36,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:30:36,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:30:36,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:30:36,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:30:36,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:30:36,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:30:36,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:30:36,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:30:36,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:30:36,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:30:36,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:30:36,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:30:36,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:30:36,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:30:36,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:30:36,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:30:36,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:30:36,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:30:36,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:30:36,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:30:36,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:30:36,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:30:36,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:30:36,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:30:36,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:30:36,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:30:36,994 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-MCR.epf [2019-12-27 23:30:37,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:30:37,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:30:37,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:30:37,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:30:37,015 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:30:37,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:30:37,015 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:30:37,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:30:37,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:30:37,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:30:37,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:30:37,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:30:37,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:30:37,018 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:30:37,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:30:37,018 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:30:37,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:30:37,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:30:37,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:30:37,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:30:37,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:30:37,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:30:37,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:30:37,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:30:37,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:30:37,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:30:37,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:30:37,020 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:30:37,021 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:30:37,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:30:37,022 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:30:37,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:30:37,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:30:37,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:30:37,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:30:37,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:30:37,303 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:30:37,304 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 23:30:37,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6bbe0118/3dea753c2d5f4a4eaaad3f3ff90bef51/FLAG783250979 [2019-12-27 23:30:37,839 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:30:37,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 23:30:37,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6bbe0118/3dea753c2d5f4a4eaaad3f3ff90bef51/FLAG783250979 [2019-12-27 23:30:38,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6bbe0118/3dea753c2d5f4a4eaaad3f3ff90bef51 [2019-12-27 23:30:38,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:30:38,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:30:38,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:38,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:30:38,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:30:38,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b065a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38, skipping insertion in model container [2019-12-27 23:30:38,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:30:38,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:30:38,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:38,735 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:30:38,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:38,893 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:30:38,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38 WrapperNode [2019-12-27 23:30:38,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:38,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:38,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:30:38,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:30:38,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:38,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:30:38,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:30:38,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:30:38,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (1/1) ... [2019-12-27 23:30:38,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:30:38,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:30:38,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:30:38,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:30:38,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (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 23:30:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:30:39,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:30:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:30:39,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:30:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:30:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:30:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:30:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:30:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:30:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:30:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:30:39,043 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 23:30:39,373 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:30:39,373 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:30:39,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:39 BoogieIcfgContainer [2019-12-27 23:30:39,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:30:39,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:30:39,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:30:39,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:30:39,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:30:38" (1/3) ... [2019-12-27 23:30:39,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654b1bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:39, skipping insertion in model container [2019-12-27 23:30:39,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:38" (2/3) ... [2019-12-27 23:30:39,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654b1bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:39, skipping insertion in model container [2019-12-27 23:30:39,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:39" (3/3) ... [2019-12-27 23:30:39,383 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2019-12-27 23:30:39,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:30:39,393 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:30:39,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:30:39,400 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:30:39,423 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,423 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,423 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,424 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,424 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,425 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,425 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,425 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,426 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,426 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,426 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,426 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,427 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,427 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,427 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,428 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,428 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,428 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,428 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,429 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,429 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,429 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,430 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,430 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,430 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,431 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,431 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,431 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,435 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,435 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,436 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,436 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,436 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,436 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,442 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,442 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,442 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,442 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,443 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,443 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:39,465 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 23:30:39,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:30:39,490 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:30:39,490 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:30:39,490 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:30:39,490 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:30:39,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:30:39,491 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:30:39,491 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:30:39,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 51 transitions [2019-12-27 23:30:39,571 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1013 states. [2019-12-27 23:30:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-27 23:30:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:30:39,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:39,584 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 23:30:39,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash -910010, now seen corresponding path program 1 times [2019-12-27 23:30:39,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:39,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542291134] [2019-12-27 23:30:39,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,971 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 23:30:39,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542291134] [2019-12-27 23:30:39,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:39,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:39,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478172462] [2019-12-27 23:30:39,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:39,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:40,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 23:30:40,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:40,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:40,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:40,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:40,021 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 5 states. [2019-12-27 23:30:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:40,174 INFO L93 Difference]: Finished difference Result 1778 states and 5126 transitions. [2019-12-27 23:30:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:30:40,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 23:30:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:40,200 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 23:30:40,200 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 23:30:40,202 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 23:30:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 23:30:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 388. [2019-12-27 23:30:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 23:30:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 993 transitions. [2019-12-27 23:30:40,298 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 993 transitions. Word has length 20 [2019-12-27 23:30:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:40,299 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 993 transitions. [2019-12-27 23:30:40,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 993 transitions. [2019-12-27 23:30:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:40,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:40,303 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 23:30:40,303 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:40,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash 723642448, now seen corresponding path program 1 times [2019-12-27 23:30:40,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:40,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46208535] [2019-12-27 23:30:40,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:40,469 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 23:30:40,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46208535] [2019-12-27 23:30:40,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:40,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:40,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867888209] [2019-12-27 23:30:40,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:40,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:40,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 41 transitions. [2019-12-27 23:30:40,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:40,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:40,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:40,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:40,492 INFO L87 Difference]: Start difference. First operand 388 states and 993 transitions. Second operand 5 states. [2019-12-27 23:30:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:40,601 INFO L93 Difference]: Finished difference Result 563 states and 1392 transitions. [2019-12-27 23:30:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:40,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:40,605 INFO L225 Difference]: With dead ends: 563 [2019-12-27 23:30:40,605 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 23:30:40,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 23:30:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 23:30:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-12-27 23:30:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-27 23:30:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 883 transitions. [2019-12-27 23:30:40,641 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 883 transitions. Word has length 23 [2019-12-27 23:30:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:40,643 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 883 transitions. [2019-12-27 23:30:40,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 883 transitions. [2019-12-27 23:30:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:40,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:40,645 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 23:30:40,645 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -660572760, now seen corresponding path program 1 times [2019-12-27 23:30:40,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:40,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769828132] [2019-12-27 23:30:40,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:40,774 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 23:30:40,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769828132] [2019-12-27 23:30:40,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:40,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:40,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298608184] [2019-12-27 23:30:40,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:40,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:40,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:30:40,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:40,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:40,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:40,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:40,782 INFO L87 Difference]: Start difference. First operand 354 states and 883 transitions. Second operand 5 states. [2019-12-27 23:30:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:40,829 INFO L93 Difference]: Finished difference Result 431 states and 1037 transitions. [2019-12-27 23:30:40,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:40,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:40,832 INFO L225 Difference]: With dead ends: 431 [2019-12-27 23:30:40,833 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 23:30:40,833 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 23:30:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 23:30:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 288. [2019-12-27 23:30:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-27 23:30:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 709 transitions. [2019-12-27 23:30:40,845 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 709 transitions. Word has length 23 [2019-12-27 23:30:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:40,845 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 709 transitions. [2019-12-27 23:30:40,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 709 transitions. [2019-12-27 23:30:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:30:40,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:40,847 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 23:30:40,847 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash -962769584, now seen corresponding path program 1 times [2019-12-27 23:30:40,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:40,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755413565] [2019-12-27 23:30:40,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:40,948 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 23:30:40,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755413565] [2019-12-27 23:30:40,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:40,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:40,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219109683] [2019-12-27 23:30:40,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:40,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:40,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 50 transitions. [2019-12-27 23:30:40,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:40,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:30:40,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:40,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:40,966 INFO L87 Difference]: Start difference. First operand 288 states and 709 transitions. Second operand 6 states. [2019-12-27 23:30:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:41,103 INFO L93 Difference]: Finished difference Result 448 states and 1078 transitions. [2019-12-27 23:30:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:41,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 23:30:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:41,106 INFO L225 Difference]: With dead ends: 448 [2019-12-27 23:30:41,107 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 23:30:41,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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 23:30:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 23:30:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-12-27 23:30:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 23:30:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 773 transitions. [2019-12-27 23:30:41,121 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 773 transitions. Word has length 26 [2019-12-27 23:30:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:41,122 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 773 transitions. [2019-12-27 23:30:41,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 773 transitions. [2019-12-27 23:30:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:41,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:41,128 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 23:30:41,129 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash -327915495, now seen corresponding path program 1 times [2019-12-27 23:30:41,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:41,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790052956] [2019-12-27 23:30:41,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:41,317 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 23:30:41,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790052956] [2019-12-27 23:30:41,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918118454] [2019-12-27 23:30:41,318 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 23:30:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:41,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:41,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:41,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,467 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 23:30:41,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:41,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:41,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1270282517] [2019-12-27 23:30:41,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:41,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:41,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 72 transitions. [2019-12-27 23:30:41,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:41,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:30:41,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:41,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:41,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:41,484 INFO L87 Difference]: Start difference. First operand 320 states and 773 transitions. Second operand 7 states. [2019-12-27 23:30:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:41,628 INFO L93 Difference]: Finished difference Result 467 states and 1116 transitions. [2019-12-27 23:30:41,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:41,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:41,632 INFO L225 Difference]: With dead ends: 467 [2019-12-27 23:30:41,632 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 23:30:41,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 23:30:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2019-12-27 23:30:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-27 23:30:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 735 transitions. [2019-12-27 23:30:41,645 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 735 transitions. Word has length 30 [2019-12-27 23:30:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:41,646 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 735 transitions. [2019-12-27 23:30:41,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 735 transitions. [2019-12-27 23:30:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:41,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:41,648 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 23:30:41,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:41,860 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash -243930643, now seen corresponding path program 1 times [2019-12-27 23:30:41,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:41,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792758779] [2019-12-27 23:30:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:41,970 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 23:30:41,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792758779] [2019-12-27 23:30:41,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355318892] [2019-12-27 23:30:41,971 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 23:30:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:42,046 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:42,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,078 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 23:30:42,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:42,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:42,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619458948] [2019-12-27 23:30:42,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:42,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:42,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 96 transitions. [2019-12-27 23:30:42,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:42,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:42,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:42,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:42,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:42,097 INFO L87 Difference]: Start difference. First operand 301 states and 735 transitions. Second operand 7 states. [2019-12-27 23:30:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:42,231 INFO L93 Difference]: Finished difference Result 581 states and 1393 transitions. [2019-12-27 23:30:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:42,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:42,237 INFO L225 Difference]: With dead ends: 581 [2019-12-27 23:30:42,238 INFO L226 Difference]: Without dead ends: 368 [2019-12-27 23:30:42,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-27 23:30:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 314. [2019-12-27 23:30:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-27 23:30:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 761 transitions. [2019-12-27 23:30:42,255 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 761 transitions. Word has length 30 [2019-12-27 23:30:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:42,256 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 761 transitions. [2019-12-27 23:30:42,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 761 transitions. [2019-12-27 23:30:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:42,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:42,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 23:30:42,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,463 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1994322550, now seen corresponding path program 1 times [2019-12-27 23:30:42,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:42,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843800956] [2019-12-27 23:30:42,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,591 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 23:30:42,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843800956] [2019-12-27 23:30:42,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138602474] [2019-12-27 23:30:42,592 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 23:30:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:42,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:42,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,691 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 23:30:42,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:42,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:42,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834009083] [2019-12-27 23:30:42,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:42,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:42,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 100 transitions. [2019-12-27 23:30:42,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:42,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:42,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:42,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:42,714 INFO L87 Difference]: Start difference. First operand 314 states and 761 transitions. Second operand 8 states. [2019-12-27 23:30:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:42,881 INFO L93 Difference]: Finished difference Result 515 states and 1212 transitions. [2019-12-27 23:30:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:42,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:42,884 INFO L225 Difference]: With dead ends: 515 [2019-12-27 23:30:42,886 INFO L226 Difference]: Without dead ends: 384 [2019-12-27 23:30:42,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-27 23:30:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-12-27 23:30:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-27 23:30:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 901 transitions. [2019-12-27 23:30:42,899 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 901 transitions. Word has length 34 [2019-12-27 23:30:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:42,899 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 901 transitions. [2019-12-27 23:30:42,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 901 transitions. [2019-12-27 23:30:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:42,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:42,901 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 23:30:43,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,113 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1246329683, now seen corresponding path program 2 times [2019-12-27 23:30:43,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:43,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598413669] [2019-12-27 23:30:43,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:43,223 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 23:30:43,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598413669] [2019-12-27 23:30:43,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783429924] [2019-12-27 23:30:43,224 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 23:30:43,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:43,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:43,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:43,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:43,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,330 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 23:30:43,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:43,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:43,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629853041] [2019-12-27 23:30:43,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:43,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:43,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 128 transitions. [2019-12-27 23:30:43,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:43,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:43,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:43,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:43,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:43,358 INFO L87 Difference]: Start difference. First operand 384 states and 901 transitions. Second operand 9 states. [2019-12-27 23:30:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:43,555 INFO L93 Difference]: Finished difference Result 531 states and 1244 transitions. [2019-12-27 23:30:43,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:30:43,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:43,558 INFO L225 Difference]: With dead ends: 531 [2019-12-27 23:30:43,558 INFO L226 Difference]: Without dead ends: 400 [2019-12-27 23:30:43,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-27 23:30:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 333. [2019-12-27 23:30:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-27 23:30:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 799 transitions. [2019-12-27 23:30:43,573 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 799 transitions. Word has length 38 [2019-12-27 23:30:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:43,573 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 799 transitions. [2019-12-27 23:30:43,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 799 transitions. [2019-12-27 23:30:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:43,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:43,576 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 23:30:43,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,788 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -40518361, now seen corresponding path program 3 times [2019-12-27 23:30:43,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:43,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039110842] [2019-12-27 23:30:43,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:43,938 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 23:30:43,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039110842] [2019-12-27 23:30:43,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292034826] [2019-12-27 23:30:43,939 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 23:30:43,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:30:43,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:43,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:30:43,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,028 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 23:30:44,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:44,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:44,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [200139366] [2019-12-27 23:30:44,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:44,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:44,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 152 transitions. [2019-12-27 23:30:44,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:44,053 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:44,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:44,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:44,055 INFO L87 Difference]: Start difference. First operand 333 states and 799 transitions. Second operand 9 states. [2019-12-27 23:30:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:44,239 INFO L93 Difference]: Finished difference Result 645 states and 1521 transitions. [2019-12-27 23:30:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:30:44,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:44,243 INFO L225 Difference]: With dead ends: 645 [2019-12-27 23:30:44,243 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 23:30:44,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 23:30:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 346. [2019-12-27 23:30:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-27 23:30:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 825 transitions. [2019-12-27 23:30:44,254 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 825 transitions. Word has length 38 [2019-12-27 23:30:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:44,254 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 825 transitions. [2019-12-27 23:30:44,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 825 transitions. [2019-12-27 23:30:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:44,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:44,255 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 23:30:44,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:44,464 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 57013188, now seen corresponding path program 4 times [2019-12-27 23:30:44,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:44,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463827133] [2019-12-27 23:30:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:44,625 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 23:30:44,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463827133] [2019-12-27 23:30:44,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456593795] [2019-12-27 23:30:44,627 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 23:30:44,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:44,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:44,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:30:44,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,801 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 23:30:44,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:44,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 23:30:44,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986163262] [2019-12-27 23:30:44,802 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:44,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:44,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 156 transitions. [2019-12-27 23:30:44,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:44,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:44,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:44,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:44,836 INFO L87 Difference]: Start difference. First operand 346 states and 825 transitions. Second operand 10 states. [2019-12-27 23:30:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:45,063 INFO L93 Difference]: Finished difference Result 677 states and 1585 transitions. [2019-12-27 23:30:45,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:45,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-12-27 23:30:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:45,067 INFO L225 Difference]: With dead ends: 677 [2019-12-27 23:30:45,067 INFO L226 Difference]: Without dead ends: 464 [2019-12-27 23:30:45,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-27 23:30:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 365. [2019-12-27 23:30:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-27 23:30:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 863 transitions. [2019-12-27 23:30:45,080 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 863 transitions. Word has length 42 [2019-12-27 23:30:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:45,080 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 863 transitions. [2019-12-27 23:30:45,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 863 transitions. [2019-12-27 23:30:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 23:30:45,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:45,081 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 23:30:45,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:45,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2041820769, now seen corresponding path program 5 times [2019-12-27 23:30:45,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:45,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774365730] [2019-12-27 23:30:45,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:45,397 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 23:30:45,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774365730] [2019-12-27 23:30:45,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375729134] [2019-12-27 23:30:45,398 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 23:30:45,452 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:30:45,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:45,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:30:45,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:45,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,494 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 23:30:45,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:45,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 23:30:45,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [27910499] [2019-12-27 23:30:45,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:45,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:45,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 208 transitions. [2019-12-27 23:30:45,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:45,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:30:45,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:30:45,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:30:45,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:45,542 INFO L87 Difference]: Start difference. First operand 365 states and 863 transitions. Second operand 11 states. [2019-12-27 23:30:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:45,761 INFO L93 Difference]: Finished difference Result 709 states and 1649 transitions. [2019-12-27 23:30:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:45,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-27 23:30:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:45,765 INFO L225 Difference]: With dead ends: 709 [2019-12-27 23:30:45,765 INFO L226 Difference]: Without dead ends: 496 [2019-12-27 23:30:45,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-27 23:30:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 378. [2019-12-27 23:30:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 23:30:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 889 transitions. [2019-12-27 23:30:45,780 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 889 transitions. Word has length 46 [2019-12-27 23:30:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:45,780 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 889 transitions. [2019-12-27 23:30:45,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:30:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 889 transitions. [2019-12-27 23:30:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:30:45,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:45,781 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 23:30:45,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:45,988 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash 216399870, now seen corresponding path program 6 times [2019-12-27 23:30:45,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:45,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789373412] [2019-12-27 23:30:45,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:46,106 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 23:30:46,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789373412] [2019-12-27 23:30:46,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780757799] [2019-12-27 23:30:46,106 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 23:30:46,159 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:30:46,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:46,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:46,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,192 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 23:30:46,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:46,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 23:30:46,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808912969] [2019-12-27 23:30:46,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:46,200 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:46,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 212 transitions. [2019-12-27 23:30:46,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:46,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:30:46,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:46,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:46,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:46,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:46,230 INFO L87 Difference]: Start difference. First operand 378 states and 889 transitions. Second operand 12 states. [2019-12-27 23:30:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:46,458 INFO L93 Difference]: Finished difference Result 741 states and 1713 transitions. [2019-12-27 23:30:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:46,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-27 23:30:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:46,462 INFO L225 Difference]: With dead ends: 741 [2019-12-27 23:30:46,462 INFO L226 Difference]: Without dead ends: 528 [2019-12-27 23:30:46,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:30:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-27 23:30:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2019-12-27 23:30:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 23:30:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 927 transitions. [2019-12-27 23:30:46,474 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 927 transitions. Word has length 50 [2019-12-27 23:30:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:46,474 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 927 transitions. [2019-12-27 23:30:46,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 927 transitions. [2019-12-27 23:30:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 23:30:46,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:46,476 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 23:30:46,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:46,680 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1337338469, now seen corresponding path program 7 times [2019-12-27 23:30:46,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:46,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258571630] [2019-12-27 23:30:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:46,820 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 23:30:46,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258571630] [2019-12-27 23:30:46,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690839342] [2019-12-27 23:30:46,821 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 23:30:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:46,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:46,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:46,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,953 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 23:30:46,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:46,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 23:30:46,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82906737] [2019-12-27 23:30:46,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:46,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:46,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 264 transitions. [2019-12-27 23:30:46,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:46,994 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:46,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:46,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:46,995 INFO L87 Difference]: Start difference. First operand 397 states and 927 transitions. Second operand 13 states. [2019-12-27 23:30:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:47,246 INFO L93 Difference]: Finished difference Result 675 states and 1532 transitions. [2019-12-27 23:30:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:47,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 23:30:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:47,249 INFO L225 Difference]: With dead ends: 675 [2019-12-27 23:30:47,250 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 23:30:47,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:30:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 23:30:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-12-27 23:30:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-27 23:30:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1221 transitions. [2019-12-27 23:30:47,263 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1221 transitions. Word has length 54 [2019-12-27 23:30:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:47,263 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1221 transitions. [2019-12-27 23:30:47,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1221 transitions. [2019-12-27 23:30:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:47,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:47,265 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 23:30:47,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:47,468 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1662726712, now seen corresponding path program 8 times [2019-12-27 23:30:47,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:47,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493348143] [2019-12-27 23:30:47,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:47,606 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 23:30:47,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493348143] [2019-12-27 23:30:47,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961895211] [2019-12-27 23:30:47,607 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 23:30:47,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:47,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:47,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 23:30:47,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:47,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,697 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 23:30:47,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:47,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:47,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106990922] [2019-12-27 23:30:47,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:47,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:47,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 268 transitions. [2019-12-27 23:30:47,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:47,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:47,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:47,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:47,788 INFO L87 Difference]: Start difference. First operand 544 states and 1221 transitions. Second operand 14 states. [2019-12-27 23:30:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:48,082 INFO L93 Difference]: Finished difference Result 789 states and 1809 transitions. [2019-12-27 23:30:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:48,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:48,086 INFO L225 Difference]: With dead ends: 789 [2019-12-27 23:30:48,086 INFO L226 Difference]: Without dead ends: 576 [2019-12-27 23:30:48,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:30:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-27 23:30:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-12-27 23:30:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 23:30:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1285 transitions. [2019-12-27 23:30:48,100 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1285 transitions. Word has length 58 [2019-12-27 23:30:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:48,100 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1285 transitions. [2019-12-27 23:30:48,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1285 transitions. [2019-12-27 23:30:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:48,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:48,101 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 23:30:48,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:48,307 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1598172444, now seen corresponding path program 9 times [2019-12-27 23:30:48,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:48,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985204043] [2019-12-27 23:30:48,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:48,449 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 23:30:48,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985204043] [2019-12-27 23:30:48,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894331932] [2019-12-27 23:30:48,451 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 23:30:48,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:30:48,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:48,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:48,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:48,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:48,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:48,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:48,541 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 23:30:48,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:48,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:48,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1460289417] [2019-12-27 23:30:48,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:48,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:48,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 292 transitions. [2019-12-27 23:30:48,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:48,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 23:30:48,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:48,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:48,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:48,673 INFO L87 Difference]: Start difference. First operand 576 states and 1285 transitions. Second operand 14 states. [2019-12-27 23:30:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:48,900 INFO L93 Difference]: Finished difference Result 723 states and 1628 transitions. [2019-12-27 23:30:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:48,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:48,906 INFO L225 Difference]: With dead ends: 723 [2019-12-27 23:30:48,906 INFO L226 Difference]: Without dead ends: 592 [2019-12-27 23:30:48,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:30:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-27 23:30:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 429. [2019-12-27 23:30:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-27 23:30:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 991 transitions. [2019-12-27 23:30:48,918 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 991 transitions. Word has length 58 [2019-12-27 23:30:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:48,918 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 991 transitions. [2019-12-27 23:30:48,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 991 transitions. [2019-12-27 23:30:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 23:30:48,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:48,919 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 23:30:49,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:49,123 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -774759723, now seen corresponding path program 10 times [2019-12-27 23:30:49,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:49,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156545396] [2019-12-27 23:30:49,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:49,271 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 23:30:49,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156545396] [2019-12-27 23:30:49,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427458027] [2019-12-27 23:30:49,272 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 23:30:49,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:49,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:49,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 23:30:49,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:49,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,376 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 23:30:49,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:49,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 23:30:49,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222894601] [2019-12-27 23:30:49,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:49,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:49,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 320 transitions. [2019-12-27 23:30:49,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:49,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 23:30:49,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:30:49,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:30:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:30:49,463 INFO L87 Difference]: Start difference. First operand 429 states and 991 transitions. Second operand 15 states. [2019-12-27 23:30:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:49,765 INFO L93 Difference]: Finished difference Result 739 states and 1660 transitions. [2019-12-27 23:30:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:49,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-12-27 23:30:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:49,769 INFO L225 Difference]: With dead ends: 739 [2019-12-27 23:30:49,769 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 23:30:49,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:30:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 23:30:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-12-27 23:30:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-27 23:30:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1349 transitions. [2019-12-27 23:30:49,783 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1349 transitions. Word has length 62 [2019-12-27 23:30:49,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:49,783 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1349 transitions. [2019-12-27 23:30:49,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:30:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1349 transitions. [2019-12-27 23:30:49,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 23:30:49,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:49,784 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 23:30:49,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:49,988 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1451259278, now seen corresponding path program 11 times [2019-12-27 23:30:49,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:49,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467480500] [2019-12-27 23:30:49,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:50,139 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 23:30:50,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467480500] [2019-12-27 23:30:50,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144491278] [2019-12-27 23:30:50,140 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 23:30:50,192 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-27 23:30:50,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:50,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:30:50,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:50,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,217 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 23:30:50,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:50,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 23:30:50,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273885161] [2019-12-27 23:30:50,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:50,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:50,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 324 transitions. [2019-12-27 23:30:50,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:50,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 23:30:50,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:50,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:50,300 INFO L87 Difference]: Start difference. First operand 608 states and 1349 transitions. Second operand 16 states. [2019-12-27 23:30:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:50,638 INFO L93 Difference]: Finished difference Result 853 states and 1937 transitions. [2019-12-27 23:30:50,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:50,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 23:30:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:50,642 INFO L225 Difference]: With dead ends: 853 [2019-12-27 23:30:50,642 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 23:30:50,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:30:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 23:30:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-12-27 23:30:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 23:30:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1413 transitions. [2019-12-27 23:30:50,656 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1413 transitions. Word has length 66 [2019-12-27 23:30:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:50,657 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1413 transitions. [2019-12-27 23:30:50,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1413 transitions. [2019-12-27 23:30:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 23:30:50,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:50,658 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 23:30:50,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:50,862 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1915950306, now seen corresponding path program 12 times [2019-12-27 23:30:50,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:50,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748135331] [2019-12-27 23:30:50,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:51,083 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 23:30:51,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748135331] [2019-12-27 23:30:51,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558525326] [2019-12-27 23:30:51,088 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 23:30:51,144 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-27 23:30:51,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:51,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:30:51,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:51,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,185 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 23:30:51,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:51,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 23:30:51,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875449076] [2019-12-27 23:30:51,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:51,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:51,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 348 transitions. [2019-12-27 23:30:51,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:51,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 23:30:51,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:51,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:51,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:51,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:51,275 INFO L87 Difference]: Start difference. First operand 640 states and 1413 transitions. Second operand 16 states. [2019-12-27 23:30:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:51,609 INFO L93 Difference]: Finished difference Result 787 states and 1756 transitions. [2019-12-27 23:30:51,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:30:51,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 23:30:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:51,617 INFO L225 Difference]: With dead ends: 787 [2019-12-27 23:30:51,617 INFO L226 Difference]: Without dead ends: 656 [2019-12-27 23:30:51,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:30:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-27 23:30:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 461. [2019-12-27 23:30:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 23:30:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1055 transitions. [2019-12-27 23:30:51,629 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1055 transitions. Word has length 66 [2019-12-27 23:30:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:51,629 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1055 transitions. [2019-12-27 23:30:51,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1055 transitions. [2019-12-27 23:30:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 23:30:51,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:51,630 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 23:30:51,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:51,834 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash -188316145, now seen corresponding path program 13 times [2019-12-27 23:30:51,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:51,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180862758] [2019-12-27 23:30:51,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:52,011 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 23:30:52,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180862758] [2019-12-27 23:30:52,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175855950] [2019-12-27 23:30:52,012 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 23:30:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:52,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 23:30:52,086 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:52,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,131 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 23:30:52,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:52,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 23:30:52,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [416311771] [2019-12-27 23:30:52,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:52,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:52,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 376 transitions. [2019-12-27 23:30:52,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:52,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 23:30:52,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:30:52,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:30:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:52,332 INFO L87 Difference]: Start difference. First operand 461 states and 1055 transitions. Second operand 17 states. [2019-12-27 23:30:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:52,668 INFO L93 Difference]: Finished difference Result 803 states and 1788 transitions. [2019-12-27 23:30:52,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:52,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-12-27 23:30:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:52,672 INFO L225 Difference]: With dead ends: 803 [2019-12-27 23:30:52,672 INFO L226 Difference]: Without dead ends: 672 [2019-12-27 23:30:52,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:30:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-27 23:30:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2019-12-27 23:30:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-12-27 23:30:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1477 transitions. [2019-12-27 23:30:52,685 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1477 transitions. Word has length 70 [2019-12-27 23:30:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:52,686 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 1477 transitions. [2019-12-27 23:30:52,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:30:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1477 transitions. [2019-12-27 23:30:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 23:30:52,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:52,687 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 23:30:52,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:52,890 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1770850476, now seen corresponding path program 14 times [2019-12-27 23:30:52,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:52,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143322593] [2019-12-27 23:30:52,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:53,091 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 23:30:53,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143322593] [2019-12-27 23:30:53,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480772133] [2019-12-27 23:30:53,093 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 23:30:53,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:53,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:53,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:53,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:53,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,198 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 23:30:53,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:53,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 23:30:53,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16000971] [2019-12-27 23:30:53,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:53,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:53,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 380 transitions. [2019-12-27 23:30:53,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:53,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 23:30:53,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:30:53,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:30:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:53,628 INFO L87 Difference]: Start difference. First operand 672 states and 1477 transitions. Second operand 18 states. [2019-12-27 23:30:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:54,033 INFO L93 Difference]: Finished difference Result 819 states and 1820 transitions. [2019-12-27 23:30:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:54,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-12-27 23:30:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:54,037 INFO L225 Difference]: With dead ends: 819 [2019-12-27 23:30:54,037 INFO L226 Difference]: Without dead ends: 688 [2019-12-27 23:30:54,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:30:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-27 23:30:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 477. [2019-12-27 23:30:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-12-27 23:30:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1087 transitions. [2019-12-27 23:30:54,049 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1087 transitions. Word has length 74 [2019-12-27 23:30:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:54,050 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 1087 transitions. [2019-12-27 23:30:54,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:30:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1087 transitions. [2019-12-27 23:30:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 23:30:54,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:54,051 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 23:30:54,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:54,255 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -37410472, now seen corresponding path program 15 times [2019-12-27 23:30:54,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:54,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190461526] [2019-12-27 23:30:54,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:54,473 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 23:30:54,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190461526] [2019-12-27 23:30:54,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657465308] [2019-12-27 23:30:54,474 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 23:30:54,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-27 23:30:54,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:54,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 23:30:54,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:54,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:54,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:54,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:54,589 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 23:30:54,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:54,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 23:30:54,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067303734] [2019-12-27 23:30:54,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:54,602 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:54,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 404 transitions. [2019-12-27 23:30:54,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:54,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 23:30:54,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:30:54,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:30:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:54,711 INFO L87 Difference]: Start difference. First operand 477 states and 1087 transitions. Second operand 18 states. [2019-12-27 23:30:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:55,073 INFO L93 Difference]: Finished difference Result 835 states and 1852 transitions. [2019-12-27 23:30:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:30:55,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-12-27 23:30:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:55,076 INFO L225 Difference]: With dead ends: 835 [2019-12-27 23:30:55,076 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 23:30:55,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=750, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:30:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 23:30:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-12-27 23:30:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-27 23:30:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1541 transitions. [2019-12-27 23:30:55,089 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1541 transitions. Word has length 74 [2019-12-27 23:30:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:55,090 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1541 transitions. [2019-12-27 23:30:55,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:30:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1541 transitions. [2019-12-27 23:30:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 23:30:55,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:55,091 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 23:30:55,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:55,296 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash -803269259, now seen corresponding path program 16 times [2019-12-27 23:30:55,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:55,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525662274] [2019-12-27 23:30:55,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:55,476 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 23:30:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525662274] [2019-12-27 23:30:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724546698] [2019-12-27 23:30:55,477 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 23:30:55,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:55,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:55,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:55,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:55,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,576 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 23:30:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:55,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 23:30:55,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946394392] [2019-12-27 23:30:55,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:55,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:55,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 408 transitions. [2019-12-27 23:30:55,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:55,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 23:30:55,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:30:55,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:55,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:30:55,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:55,711 INFO L87 Difference]: Start difference. First operand 704 states and 1541 transitions. Second operand 19 states. [2019-12-27 23:30:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:56,095 INFO L93 Difference]: Finished difference Result 851 states and 1884 transitions. [2019-12-27 23:30:56,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:30:56,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-27 23:30:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:56,106 INFO L225 Difference]: With dead ends: 851 [2019-12-27 23:30:56,106 INFO L226 Difference]: Without dead ends: 720 [2019-12-27 23:30:56,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:30:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-12-27 23:30:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 493. [2019-12-27 23:30:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-12-27 23:30:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1119 transitions. [2019-12-27 23:30:56,120 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1119 transitions. Word has length 78 [2019-12-27 23:30:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:56,120 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 1119 transitions. [2019-12-27 23:30:56,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:30:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1119 transitions. [2019-12-27 23:30:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 23:30:56,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:56,125 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 23:30:56,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:56,329 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash 362878793, now seen corresponding path program 17 times [2019-12-27 23:30:56,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:56,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117950370] [2019-12-27 23:30:56,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:56,529 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 23:30:56,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117950370] [2019-12-27 23:30:56,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352167053] [2019-12-27 23:30:56,530 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 23:30:56,590 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-27 23:30:56,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:56,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:56,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:56,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,628 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 23:30:56,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:56,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 23:30:56,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965727449] [2019-12-27 23:30:56,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:56,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:56,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 432 transitions. [2019-12-27 23:30:56,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:56,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 23:30:56,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:30:56,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:30:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:56,769 INFO L87 Difference]: Start difference. First operand 493 states and 1119 transitions. Second operand 19 states. [2019-12-27 23:30:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:57,202 INFO L93 Difference]: Finished difference Result 867 states and 1916 transitions. [2019-12-27 23:30:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:57,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-27 23:30:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:57,206 INFO L225 Difference]: With dead ends: 867 [2019-12-27 23:30:57,206 INFO L226 Difference]: Without dead ends: 736 [2019-12-27 23:30:57,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=895, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:30:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-12-27 23:30:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-12-27 23:30:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 23:30:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1605 transitions. [2019-12-27 23:30:57,220 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1605 transitions. Word has length 78 [2019-12-27 23:30:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:57,220 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1605 transitions. [2019-12-27 23:30:57,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:30:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1605 transitions. [2019-12-27 23:30:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 23:30:57,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:57,222 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 23:30:57,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:57,425 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash 314420454, now seen corresponding path program 18 times [2019-12-27 23:30:57,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:57,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412523434] [2019-12-27 23:30:57,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:57,616 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 23:30:57,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412523434] [2019-12-27 23:30:57,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83459382] [2019-12-27 23:30:57,617 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 23:30:57,680 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 23:30:57,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:57,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 23:30:57,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:57,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,732 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 23:30:57,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:57,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 23:30:57,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [770445773] [2019-12-27 23:30:57,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:57,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:57,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 436 transitions. [2019-12-27 23:30:57,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:57,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 23:30:57,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:30:57,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:30:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:57,930 INFO L87 Difference]: Start difference. First operand 736 states and 1605 transitions. Second operand 20 states. [2019-12-27 23:30:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:58,373 INFO L93 Difference]: Finished difference Result 981 states and 2193 transitions. [2019-12-27 23:30:58,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:30:58,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-12-27 23:30:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:58,377 INFO L225 Difference]: With dead ends: 981 [2019-12-27 23:30:58,377 INFO L226 Difference]: Without dead ends: 768 [2019-12-27 23:30:58,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=446, Invalid=1114, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:30:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-27 23:30:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2019-12-27 23:30:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-27 23:30:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1669 transitions. [2019-12-27 23:30:58,390 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1669 transitions. Word has length 82 [2019-12-27 23:30:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:58,390 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1669 transitions. [2019-12-27 23:30:58,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:30:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1669 transitions. [2019-12-27 23:30:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 23:30:58,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:58,393 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 23:30:58,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:58,598 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash 539004306, now seen corresponding path program 19 times [2019-12-27 23:30:58,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:58,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114700871] [2019-12-27 23:30:58,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:58,792 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 23:30:58,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114700871] [2019-12-27 23:30:58,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142128805] [2019-12-27 23:30:58,792 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 23:30:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:58,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 23:30:58,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:58,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:58,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:58,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:58,888 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 23:30:58,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:58,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 23:30:58,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779464613] [2019-12-27 23:30:58,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:58,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:59,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 460 transitions. [2019-12-27 23:30:59,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:59,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 47 times. [2019-12-27 23:30:59,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:30:59,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:30:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:59,027 INFO L87 Difference]: Start difference. First operand 768 states and 1669 transitions. Second operand 20 states. [2019-12-27 23:30:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:59,463 INFO L93 Difference]: Finished difference Result 915 states and 2012 transitions. [2019-12-27 23:30:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:30:59,463 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-12-27 23:30:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:59,467 INFO L225 Difference]: With dead ends: 915 [2019-12-27 23:30:59,468 INFO L226 Difference]: Without dead ends: 784 [2019-12-27 23:30:59,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=998, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:30:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-27 23:30:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 525. [2019-12-27 23:30:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-12-27 23:30:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1183 transitions. [2019-12-27 23:30:59,481 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1183 transitions. Word has length 82 [2019-12-27 23:30:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:59,482 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 1183 transitions. [2019-12-27 23:30:59,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:30:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1183 transitions. [2019-12-27 23:30:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 23:30:59,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:59,483 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 23:30:59,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:59,687 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 383504003, now seen corresponding path program 20 times [2019-12-27 23:30:59,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:59,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387299039] [2019-12-27 23:30:59,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:59,995 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 23:30:59,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387299039] [2019-12-27 23:30:59,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597961211] [2019-12-27 23:30:59,996 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 23:31:00,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:00,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:00,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 23:31:00,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:00,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:00,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:00,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:00,094 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 23:31:00,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:00,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 23:31:00,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415896489] [2019-12-27 23:31:00,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:00,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:00,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 288 states and 488 transitions. [2019-12-27 23:31:00,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:00,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-27 23:31:00,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 23:31:00,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 23:31:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:31:00,199 INFO L87 Difference]: Start difference. First operand 525 states and 1183 transitions. Second operand 21 states. [2019-12-27 23:31:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:00,713 INFO L93 Difference]: Finished difference Result 1029 states and 2289 transitions. [2019-12-27 23:31:00,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:31:00,714 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2019-12-27 23:31:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:00,717 INFO L225 Difference]: With dead ends: 1029 [2019-12-27 23:31:00,717 INFO L226 Difference]: Without dead ends: 816 [2019-12-27 23:31:00,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:31:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-12-27 23:31:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 538. [2019-12-27 23:31:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-27 23:31:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1209 transitions. [2019-12-27 23:31:00,728 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1209 transitions. Word has length 86 [2019-12-27 23:31:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:00,728 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1209 transitions. [2019-12-27 23:31:00,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 23:31:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1209 transitions. [2019-12-27 23:31:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 23:31:00,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:00,730 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 23:31:00,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:00,933 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash -91523296, now seen corresponding path program 21 times [2019-12-27 23:31:00,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:00,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156711963] [2019-12-27 23:31:00,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:01,203 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 23:31:01,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156711963] [2019-12-27 23:31:01,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950468128] [2019-12-27 23:31:01,204 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 23:31:01,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 23:31:01,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:01,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 23:31:01,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:01,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:01,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:01,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:01,309 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 23:31:01,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:01,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 23:31:01,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164898950] [2019-12-27 23:31:01,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:01,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:01,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 492 transitions. [2019-12-27 23:31:01,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:01,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-27 23:31:01,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 23:31:01,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:01,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 23:31:01,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:31:01,467 INFO L87 Difference]: Start difference. First operand 538 states and 1209 transitions. Second operand 22 states. [2019-12-27 23:31:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:01,997 INFO L93 Difference]: Finished difference Result 1061 states and 2353 transitions. [2019-12-27 23:31:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:31:01,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2019-12-27 23:31:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:02,001 INFO L225 Difference]: With dead ends: 1061 [2019-12-27 23:31:02,001 INFO L226 Difference]: Without dead ends: 848 [2019-12-27 23:31:02,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:31:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-27 23:31:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 557. [2019-12-27 23:31:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-12-27 23:31:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1247 transitions. [2019-12-27 23:31:02,011 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1247 transitions. Word has length 90 [2019-12-27 23:31:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:02,012 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 1247 transitions. [2019-12-27 23:31:02,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 23:31:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1247 transitions. [2019-12-27 23:31:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 23:31:02,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:02,013 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 23:31:02,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:02,217 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:02,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1057969219, now seen corresponding path program 22 times [2019-12-27 23:31:02,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:02,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413630524] [2019-12-27 23:31:02,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:02,489 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 23:31:02,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413630524] [2019-12-27 23:31:02,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877635610] [2019-12-27 23:31:02,490 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 23:31:02,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:02,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:02,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 23:31:02,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:02,593 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 23:31:02,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:02,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 23:31:02,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130903026] [2019-12-27 23:31:02,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:02,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:02,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 320 states and 544 transitions. [2019-12-27 23:31:02,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:02,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 56 times. [2019-12-27 23:31:02,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 23:31:02,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 23:31:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:31:02,936 INFO L87 Difference]: Start difference. First operand 557 states and 1247 transitions. Second operand 23 states. [2019-12-27 23:31:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:03,572 INFO L93 Difference]: Finished difference Result 995 states and 2172 transitions. [2019-12-27 23:31:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:31:03,572 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2019-12-27 23:31:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:03,576 INFO L225 Difference]: With dead ends: 995 [2019-12-27 23:31:03,576 INFO L226 Difference]: Without dead ends: 864 [2019-12-27 23:31:03,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=553, Invalid=1339, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:31:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-12-27 23:31:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-12-27 23:31:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-12-27 23:31:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1861 transitions. [2019-12-27 23:31:03,590 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1861 transitions. Word has length 94 [2019-12-27 23:31:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:03,590 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1861 transitions. [2019-12-27 23:31:03,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 23:31:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1861 transitions. [2019-12-27 23:31:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:31:03,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:03,592 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 23:31:03,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:03,796 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1550870362, now seen corresponding path program 23 times [2019-12-27 23:31:03,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:03,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987616533] [2019-12-27 23:31:03,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:04,136 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 23:31:04,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987616533] [2019-12-27 23:31:04,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058697235] [2019-12-27 23:31:04,137 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 23:31:04,231 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-27 23:31:04,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:04,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 23:31:04,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:04,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:04,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:04,293 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 23:31:04,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:04,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 23:31:04,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723014385] [2019-12-27 23:31:04,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:04,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:04,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 324 states and 548 transitions. [2019-12-27 23:31:04,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:04,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 56 times. [2019-12-27 23:31:04,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 23:31:04,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:04,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 23:31:04,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:31:04,546 INFO L87 Difference]: Start difference. First operand 864 states and 1861 transitions. Second operand 24 states. [2019-12-27 23:31:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:05,203 INFO L93 Difference]: Finished difference Result 1109 states and 2449 transitions. [2019-12-27 23:31:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 23:31:05,203 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-12-27 23:31:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:05,207 INFO L225 Difference]: With dead ends: 1109 [2019-12-27 23:31:05,207 INFO L226 Difference]: Without dead ends: 896 [2019-12-27 23:31:05,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=652, Invalid=1604, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 23:31:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-12-27 23:31:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2019-12-27 23:31:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-27 23:31:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1925 transitions. [2019-12-27 23:31:05,221 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1925 transitions. Word has length 98 [2019-12-27 23:31:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:05,222 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1925 transitions. [2019-12-27 23:31:05,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 23:31:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1925 transitions. [2019-12-27 23:31:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:31:05,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:05,224 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 23:31:05,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:05,427 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1209481210, now seen corresponding path program 24 times [2019-12-27 23:31:05,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:05,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960241657] [2019-12-27 23:31:05,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:05,718 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 23:31:05,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960241657] [2019-12-27 23:31:05,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248263627] [2019-12-27 23:31:05,719 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 23:31:05,816 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-27 23:31:05,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:05,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 23:31:05,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:05,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:05,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:05,868 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 23:31:05,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:05,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 23:31:05,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613603202] [2019-12-27 23:31:05,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:05,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:06,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 336 states and 572 transitions. [2019-12-27 23:31:06,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:06,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 59 times. [2019-12-27 23:31:06,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 23:31:06,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 23:31:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:31:06,113 INFO L87 Difference]: Start difference. First operand 896 states and 1925 transitions. Second operand 24 states. [2019-12-27 23:31:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:06,692 INFO L93 Difference]: Finished difference Result 1043 states and 2268 transitions. [2019-12-27 23:31:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 23:31:06,693 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-12-27 23:31:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:06,698 INFO L225 Difference]: With dead ends: 1043 [2019-12-27 23:31:06,698 INFO L226 Difference]: Without dead ends: 912 [2019-12-27 23:31:06,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=606, Invalid=1464, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 23:31:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-12-27 23:31:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 589. [2019-12-27 23:31:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-12-27 23:31:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1311 transitions. [2019-12-27 23:31:06,713 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1311 transitions. Word has length 98 [2019-12-27 23:31:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:06,713 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 1311 transitions. [2019-12-27 23:31:06,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 23:31:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1311 transitions. [2019-12-27 23:31:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:31:06,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:06,715 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 23:31:06,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:06,918 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:06,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1034309897, now seen corresponding path program 25 times [2019-12-27 23:31:06,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:06,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098157370] [2019-12-27 23:31:06,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:07,238 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 23:31:07,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098157370] [2019-12-27 23:31:07,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508256490] [2019-12-27 23:31:07,238 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 23:31:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:07,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 23:31:07,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:07,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:07,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:07,346 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 23:31:07,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:07,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 23:31:07,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562471504] [2019-12-27 23:31:07,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:07,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:07,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 352 states and 600 transitions. [2019-12-27 23:31:07,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:07,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 62 times. [2019-12-27 23:31:07,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 23:31:07,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:07,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 23:31:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:31:07,594 INFO L87 Difference]: Start difference. First operand 589 states and 1311 transitions. Second operand 25 states. [2019-12-27 23:31:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:08,284 INFO L93 Difference]: Finished difference Result 1157 states and 2545 transitions. [2019-12-27 23:31:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 23:31:08,285 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-12-27 23:31:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:08,290 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 23:31:08,290 INFO L226 Difference]: Without dead ends: 944 [2019-12-27 23:31:08,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 23:31:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-12-27 23:31:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 602. [2019-12-27 23:31:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 23:31:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1337 transitions. [2019-12-27 23:31:08,301 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1337 transitions. Word has length 102 [2019-12-27 23:31:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:08,301 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1337 transitions. [2019-12-27 23:31:08,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 23:31:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1337 transitions. [2019-12-27 23:31:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-27 23:31:08,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:08,303 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 23:31:08,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:08,506 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1508277652, now seen corresponding path program 26 times [2019-12-27 23:31:08,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:08,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563127017] [2019-12-27 23:31:08,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:08,837 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 23:31:08,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563127017] [2019-12-27 23:31:08,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809539742] [2019-12-27 23:31:08,837 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 23:31:08,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:08,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:08,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-27 23:31:08,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:08,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:08,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:08,947 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 23:31:08,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:08,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 23:31:08,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333014521] [2019-12-27 23:31:08,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:08,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:09,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 356 states and 604 transitions. [2019-12-27 23:31:09,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:09,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 62 times. [2019-12-27 23:31:09,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 23:31:09,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 23:31:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:31:09,231 INFO L87 Difference]: Start difference. First operand 602 states and 1337 transitions. Second operand 26 states. [2019-12-27 23:31:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:09,967 INFO L93 Difference]: Finished difference Result 1189 states and 2609 transitions. [2019-12-27 23:31:09,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 23:31:09,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-12-27 23:31:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:09,971 INFO L225 Difference]: With dead ends: 1189 [2019-12-27 23:31:09,971 INFO L226 Difference]: Without dead ends: 976 [2019-12-27 23:31:09,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=770, Invalid=1882, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 23:31:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-27 23:31:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 621. [2019-12-27 23:31:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-12-27 23:31:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1375 transitions. [2019-12-27 23:31:09,987 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1375 transitions. Word has length 106 [2019-12-27 23:31:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:09,987 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 1375 transitions. [2019-12-27 23:31:09,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 23:31:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1375 transitions. [2019-12-27 23:31:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-27 23:31:09,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:09,994 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 23:31:10,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:10,197 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1349461967, now seen corresponding path program 27 times [2019-12-27 23:31:10,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:10,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654628172] [2019-12-27 23:31:10,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:10,602 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 23:31:10,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654628172] [2019-12-27 23:31:10,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742332549] [2019-12-27 23:31:10,603 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 23:31:10,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-27 23:31:10,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:10,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 23:31:10,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:10,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:10,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:10,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:10,766 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 23:31:10,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:10,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 23:31:10,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840249140] [2019-12-27 23:31:10,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:10,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:11,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 384 states and 656 transitions. [2019-12-27 23:31:11,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:11,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 68 times. [2019-12-27 23:31:11,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 23:31:11,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 23:31:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:31:11,504 INFO L87 Difference]: Start difference. First operand 621 states and 1375 transitions. Second operand 27 states. [2019-12-27 23:31:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:12,207 INFO L93 Difference]: Finished difference Result 1221 states and 2673 transitions. [2019-12-27 23:31:12,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 23:31:12,207 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-12-27 23:31:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:12,214 INFO L225 Difference]: With dead ends: 1221 [2019-12-27 23:31:12,214 INFO L226 Difference]: Without dead ends: 1008 [2019-12-27 23:31:12,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=786, Invalid=1970, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 23:31:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-27 23:31:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 634. [2019-12-27 23:31:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-12-27 23:31:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1401 transitions. [2019-12-27 23:31:12,229 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1401 transitions. Word has length 110 [2019-12-27 23:31:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:12,229 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 1401 transitions. [2019-12-27 23:31:12,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 23:31:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1401 transitions. [2019-12-27 23:31:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 23:31:12,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:12,231 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 23:31:12,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:12,435 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -93865522, now seen corresponding path program 28 times [2019-12-27 23:31:12,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:12,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270294932] [2019-12-27 23:31:12,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:12,842 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 23:31:12,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270294932] [2019-12-27 23:31:12,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533858068] [2019-12-27 23:31:12,843 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 23:31:12,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:12,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:12,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 23:31:12,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:12,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:13,006 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 23:31:13,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:13,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 23:31:13,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672412904] [2019-12-27 23:31:13,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:13,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:13,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 388 states and 660 transitions. [2019-12-27 23:31:13,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:13,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 68 times. [2019-12-27 23:31:13,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 23:31:13,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:13,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 23:31:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:31:13,350 INFO L87 Difference]: Start difference. First operand 634 states and 1401 transitions. Second operand 28 states. [2019-12-27 23:31:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:14,131 INFO L93 Difference]: Finished difference Result 1253 states and 2737 transitions. [2019-12-27 23:31:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 23:31:14,132 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2019-12-27 23:31:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:14,135 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 23:31:14,135 INFO L226 Difference]: Without dead ends: 1040 [2019-12-27 23:31:14,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=898, Invalid=2182, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 23:31:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-12-27 23:31:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 653. [2019-12-27 23:31:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-12-27 23:31:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1439 transitions. [2019-12-27 23:31:14,149 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1439 transitions. Word has length 114 [2019-12-27 23:31:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:14,150 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 1439 transitions. [2019-12-27 23:31:14,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 23:31:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1439 transitions. [2019-12-27 23:31:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-27 23:31:14,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:14,152 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 23:31:14,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:14,355 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash 51390315, now seen corresponding path program 29 times [2019-12-27 23:31:14,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:14,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156598711] [2019-12-27 23:31:14,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:14,896 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 23:31:14,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156598711] [2019-12-27 23:31:14,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284772470] [2019-12-27 23:31:14,897 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 23:31:14,968 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-27 23:31:14,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:14,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 23:31:14,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:15,018 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 23:31:15,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:15,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 23:31:15,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021700364] [2019-12-27 23:31:15,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:15,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:15,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 416 states and 712 transitions. [2019-12-27 23:31:15,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:15,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 74 times. [2019-12-27 23:31:15,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:31:15,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:31:15,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:31:15,280 INFO L87 Difference]: Start difference. First operand 653 states and 1439 transitions. Second operand 29 states. [2019-12-27 23:31:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:16,035 INFO L93 Difference]: Finished difference Result 1187 states and 2556 transitions. [2019-12-27 23:31:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 23:31:16,035 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2019-12-27 23:31:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:16,037 INFO L225 Difference]: With dead ends: 1187 [2019-12-27 23:31:16,037 INFO L226 Difference]: Without dead ends: 1056 [2019-12-27 23:31:16,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=910, Invalid=2170, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 23:31:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-27 23:31:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2019-12-27 23:31:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 23:31:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2245 transitions. [2019-12-27 23:31:16,056 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2245 transitions. Word has length 118 [2019-12-27 23:31:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:16,056 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2245 transitions. [2019-12-27 23:31:16,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:31:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2245 transitions. [2019-12-27 23:31:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-27 23:31:16,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:16,058 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 23:31:16,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:16,262 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash 728636424, now seen corresponding path program 30 times [2019-12-27 23:31:16,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:16,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755779487] [2019-12-27 23:31:16,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:16,734 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 23:31:16,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755779487] [2019-12-27 23:31:16,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482560638] [2019-12-27 23:31:16,735 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 23:31:16,862 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-27 23:31:16,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:16,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-27 23:31:16,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:16,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:16,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:16,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:16,923 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 23:31:16,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 23:31:16,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757412642] [2019-12-27 23:31:16,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:16,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:17,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 420 states and 716 transitions. [2019-12-27 23:31:17,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:17,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 74 times. [2019-12-27 23:31:17,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:31:17,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:31:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:31:17,230 INFO L87 Difference]: Start difference. First operand 1056 states and 2245 transitions. Second operand 30 states. [2019-12-27 23:31:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:18,162 INFO L93 Difference]: Finished difference Result 1301 states and 2833 transitions. [2019-12-27 23:31:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:31:18,162 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2019-12-27 23:31:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:18,165 INFO L225 Difference]: With dead ends: 1301 [2019-12-27 23:31:18,165 INFO L226 Difference]: Without dead ends: 1088 [2019-12-27 23:31:18,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1036, Invalid=2504, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 23:31:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-12-27 23:31:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2019-12-27 23:31:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-12-27 23:31:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2309 transitions. [2019-12-27 23:31:18,178 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2309 transitions. Word has length 122 [2019-12-27 23:31:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:18,178 INFO L462 AbstractCegarLoop]: Abstraction has 1088 states and 2309 transitions. [2019-12-27 23:31:18,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 23:31:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2309 transitions. [2019-12-27 23:31:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-27 23:31:18,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:18,180 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 23:31:18,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:18,388 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1587102540, now seen corresponding path program 31 times [2019-12-27 23:31:18,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:18,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410202942] [2019-12-27 23:31:18,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:18,852 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 23:31:18,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410202942] [2019-12-27 23:31:18,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873808683] [2019-12-27 23:31:18,853 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 23:31:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:18,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 23:31:18,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:18,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:18,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:18,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:18,995 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 23:31:18,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:18,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 23:31:18,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566001647] [2019-12-27 23:31:18,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:19,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:19,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 432 states and 740 transitions. [2019-12-27 23:31:19,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:19,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 77 times. [2019-12-27 23:31:19,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:31:19,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:31:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:31:19,344 INFO L87 Difference]: Start difference. First operand 1088 states and 2309 transitions. Second operand 30 states. [2019-12-27 23:31:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:20,109 INFO L93 Difference]: Finished difference Result 1235 states and 2652 transitions. [2019-12-27 23:31:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 23:31:20,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2019-12-27 23:31:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:20,112 INFO L225 Difference]: With dead ends: 1235 [2019-12-27 23:31:20,112 INFO L226 Difference]: Without dead ends: 1104 [2019-12-27 23:31:20,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=948, Invalid=2244, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 23:31:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-12-27 23:31:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 685. [2019-12-27 23:31:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-27 23:31:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1503 transitions. [2019-12-27 23:31:20,129 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1503 transitions. Word has length 122 [2019-12-27 23:31:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:20,130 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1503 transitions. [2019-12-27 23:31:20,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 23:31:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1503 transitions. [2019-12-27 23:31:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-27 23:31:20,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:20,131 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 23:31:20,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:20,335 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash 491887781, now seen corresponding path program 32 times [2019-12-27 23:31:20,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:20,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653628713] [2019-12-27 23:31:20,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:20,719 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 23:31:20,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653628713] [2019-12-27 23:31:20,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538696405] [2019-12-27 23:31:20,720 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 23:31:20,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:20,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:20,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 23:31:20,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:20,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:20,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:20,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:20,835 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 23:31:20,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:20,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 23:31:20,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076323691] [2019-12-27 23:31:20,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:20,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:21,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 448 states and 768 transitions. [2019-12-27 23:31:21,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:21,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 80 times. [2019-12-27 23:31:21,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 23:31:21,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 23:31:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:31:21,264 INFO L87 Difference]: Start difference. First operand 685 states and 1503 transitions. Second operand 31 states. [2019-12-27 23:31:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:22,163 INFO L93 Difference]: Finished difference Result 1251 states and 2684 transitions. [2019-12-27 23:31:22,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 23:31:22,164 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 126 [2019-12-27 23:31:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:22,167 INFO L225 Difference]: With dead ends: 1251 [2019-12-27 23:31:22,167 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 23:31:22,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1049, Invalid=2491, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 23:31:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 23:31:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2019-12-27 23:31:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-12-27 23:31:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2373 transitions. [2019-12-27 23:31:22,185 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2373 transitions. Word has length 126 [2019-12-27 23:31:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:22,185 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 2373 transitions. [2019-12-27 23:31:22,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 23:31:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2373 transitions. [2019-12-27 23:31:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-27 23:31:22,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:22,188 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 23:31:22,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:22,391 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1066163134, now seen corresponding path program 33 times [2019-12-27 23:31:22,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:22,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908889959] [2019-12-27 23:31:22,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:22,774 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 23:31:22,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908889959] [2019-12-27 23:31:22,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520466254] [2019-12-27 23:31:22,775 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 23:31:22,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-27 23:31:22,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:22,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 23:31:22,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:22,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:22,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:22,907 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 23:31:22,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:22,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 23:31:22,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966292327] [2019-12-27 23:31:22,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:22,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:23,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 452 states and 772 transitions. [2019-12-27 23:31:23,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:23,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 80 times. [2019-12-27 23:31:23,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 23:31:23,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 23:31:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:31:23,352 INFO L87 Difference]: Start difference. First operand 1120 states and 2373 transitions. Second operand 32 states. [2019-12-27 23:31:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:24,260 INFO L93 Difference]: Finished difference Result 1365 states and 2961 transitions. [2019-12-27 23:31:24,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 23:31:24,261 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 130 [2019-12-27 23:31:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:24,264 INFO L225 Difference]: With dead ends: 1365 [2019-12-27 23:31:24,264 INFO L226 Difference]: Without dead ends: 1152 [2019-12-27 23:31:24,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1184, Invalid=2848, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 23:31:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-12-27 23:31:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2019-12-27 23:31:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-12-27 23:31:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 2437 transitions. [2019-12-27 23:31:24,282 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 2437 transitions. Word has length 130 [2019-12-27 23:31:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:24,282 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 2437 transitions. [2019-12-27 23:31:24,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 23:31:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 2437 transitions. [2019-12-27 23:31:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-27 23:31:24,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:24,284 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 23:31:24,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:24,488 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 655820014, now seen corresponding path program 34 times [2019-12-27 23:31:24,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:24,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893111895] [2019-12-27 23:31:24,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:24,966 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 23:31:24,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893111895] [2019-12-27 23:31:24,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493482342] [2019-12-27 23:31:24,966 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 23:31:25,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:25,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:25,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 23:31:25,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:25,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:25,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:25,095 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 23:31:25,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:25,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 23:31:25,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573233913] [2019-12-27 23:31:25,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:25,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:25,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 464 states and 796 transitions. [2019-12-27 23:31:25,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:25,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 83 times. [2019-12-27 23:31:25,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 23:31:25,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 23:31:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:31:25,647 INFO L87 Difference]: Start difference. First operand 1152 states and 2437 transitions. Second operand 32 states. [2019-12-27 23:31:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:26,589 INFO L93 Difference]: Finished difference Result 1299 states and 2780 transitions. [2019-12-27 23:31:26,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 23:31:26,590 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 130 [2019-12-27 23:31:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:26,593 INFO L225 Difference]: With dead ends: 1299 [2019-12-27 23:31:26,593 INFO L226 Difference]: Without dead ends: 1168 [2019-12-27 23:31:26,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1090, Invalid=2570, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 23:31:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2019-12-27 23:31:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 717. [2019-12-27 23:31:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-27 23:31:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1567 transitions. [2019-12-27 23:31:26,606 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1567 transitions. Word has length 130 [2019-12-27 23:31:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:26,606 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1567 transitions. [2019-12-27 23:31:26,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 23:31:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1567 transitions. [2019-12-27 23:31:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-27 23:31:26,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:26,608 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 23:31:26,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:26,811 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1154430943, now seen corresponding path program 35 times [2019-12-27 23:31:26,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:26,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806233972] [2019-12-27 23:31:26,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:27,232 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 23:31:27,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806233972] [2019-12-27 23:31:27,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559003250] [2019-12-27 23:31:27,232 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 23:31:27,308 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-12-27 23:31:27,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:27,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-27 23:31:27,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:27,367 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 23:31:27,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:27,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 23:31:27,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260774941] [2019-12-27 23:31:27,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:27,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:27,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 480 states and 824 transitions. [2019-12-27 23:31:27,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:27,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 86 times. [2019-12-27 23:31:27,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 23:31:27,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 23:31:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:31:27,699 INFO L87 Difference]: Start difference. First operand 717 states and 1567 transitions. Second operand 33 states. [2019-12-27 23:31:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:28,621 INFO L93 Difference]: Finished difference Result 1315 states and 2812 transitions. [2019-12-27 23:31:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:31:28,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2019-12-27 23:31:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:28,623 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 23:31:28,623 INFO L226 Difference]: Without dead ends: 1184 [2019-12-27 23:31:28,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1198, Invalid=2834, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 23:31:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-27 23:31:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2019-12-27 23:31:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-12-27 23:31:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2501 transitions. [2019-12-27 23:31:28,635 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2501 transitions. Word has length 134 [2019-12-27 23:31:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:28,635 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 2501 transitions. [2019-12-27 23:31:28,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 23:31:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2501 transitions. [2019-12-27 23:31:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 23:31:28,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:28,637 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 23:31:28,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:28,840 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1928483452, now seen corresponding path program 36 times [2019-12-27 23:31:28,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:28,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181531053] [2019-12-27 23:31:28,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:29,297 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 23:31:29,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181531053] [2019-12-27 23:31:29,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384430612] [2019-12-27 23:31:29,298 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 23:31:29,381 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-12-27 23:31:29,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:29,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 23:31:29,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:29,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:29,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:29,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:29,423 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 23:31:29,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:29,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 23:31:29,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258642439] [2019-12-27 23:31:29,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:29,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:29,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 484 states and 828 transitions. [2019-12-27 23:31:29,765 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:29,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 86 times. [2019-12-27 23:31:29,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 23:31:29,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 23:31:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:31:29,772 INFO L87 Difference]: Start difference. First operand 1184 states and 2501 transitions. Second operand 34 states. [2019-12-27 23:31:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:30,777 INFO L93 Difference]: Finished difference Result 1331 states and 2844 transitions. [2019-12-27 23:31:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 23:31:30,777 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 138 [2019-12-27 23:31:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:30,779 INFO L225 Difference]: With dead ends: 1331 [2019-12-27 23:31:30,779 INFO L226 Difference]: Without dead ends: 1200 [2019-12-27 23:31:30,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1337, Invalid=3085, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 23:31:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-12-27 23:31:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 733. [2019-12-27 23:31:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-12-27 23:31:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1599 transitions. [2019-12-27 23:31:30,794 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1599 transitions. Word has length 138 [2019-12-27 23:31:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:30,794 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1599 transitions. [2019-12-27 23:31:30,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 23:31:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1599 transitions. [2019-12-27 23:31:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 23:31:30,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:30,796 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 23:31:30,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:31,000 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -746556632, now seen corresponding path program 37 times [2019-12-27 23:31:31,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:31,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175282925] [2019-12-27 23:31:31,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:31,577 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 23:31:31,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175282925] [2019-12-27 23:31:31,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814173752] [2019-12-27 23:31:31,578 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 23:31:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:31,652 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 23:31:31,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:31,724 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 23:31:31,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:31,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 23:31:31,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602578441] [2019-12-27 23:31:31,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:31,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:32,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 496 states and 852 transitions. [2019-12-27 23:31:32,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:32,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 89 times. [2019-12-27 23:31:32,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 23:31:32,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 23:31:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:31:32,189 INFO L87 Difference]: Start difference. First operand 733 states and 1599 transitions. Second operand 34 states. [2019-12-27 23:31:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:33,087 INFO L93 Difference]: Finished difference Result 1347 states and 2876 transitions. [2019-12-27 23:31:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 23:31:33,087 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 138 [2019-12-27 23:31:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:33,089 INFO L225 Difference]: With dead ends: 1347 [2019-12-27 23:31:33,089 INFO L226 Difference]: Without dead ends: 1216 [2019-12-27 23:31:33,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1242, Invalid=2918, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 23:31:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-12-27 23:31:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2019-12-27 23:31:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-27 23:31:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 2565 transitions. [2019-12-27 23:31:33,102 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 2565 transitions. Word has length 138 [2019-12-27 23:31:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:33,102 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 2565 transitions. [2019-12-27 23:31:33,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 23:31:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2565 transitions. [2019-12-27 23:31:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-27 23:31:33,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:33,104 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 23:31:33,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:33,308 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1356138683, now seen corresponding path program 38 times [2019-12-27 23:31:33,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:33,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347389318] [2019-12-27 23:31:33,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:33,741 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 23:31:33,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347389318] [2019-12-27 23:31:33,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157696820] [2019-12-27 23:31:33,742 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:33,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:33,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:33,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 23:31:33,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:33,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:33,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:33,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:33,891 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 23:31:33,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:33,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 23:31:33,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354394049] [2019-12-27 23:31:33,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:33,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:34,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 500 states and 856 transitions. [2019-12-27 23:31:34,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:34,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 89 times. [2019-12-27 23:31:34,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:31:34,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:31:34,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:31:34,374 INFO L87 Difference]: Start difference. First operand 1216 states and 2565 transitions. Second operand 35 states. [2019-12-27 23:31:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:35,286 INFO L93 Difference]: Finished difference Result 1363 states and 2908 transitions. [2019-12-27 23:31:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 23:31:35,287 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-12-27 23:31:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:35,289 INFO L225 Difference]: With dead ends: 1363 [2019-12-27 23:31:35,289 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 23:31:35,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1384, Invalid=3172, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 23:31:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 23:31:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 749. [2019-12-27 23:31:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-12-27 23:31:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1631 transitions. [2019-12-27 23:31:35,301 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1631 transitions. Word has length 142 [2019-12-27 23:31:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:35,302 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1631 transitions. [2019-12-27 23:31:35,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:31:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1631 transitions. [2019-12-27 23:31:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-27 23:31:35,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:35,303 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 23:31:35,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:35,504 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1509754599, now seen corresponding path program 39 times [2019-12-27 23:31:35,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:35,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590258595] [2019-12-27 23:31:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:35,921 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 23:31:35,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590258595] [2019-12-27 23:31:35,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964391160] [2019-12-27 23:31:35,922 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:36,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-12-27 23:31:36,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:36,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 23:31:36,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:36,079 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 23:31:36,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:36,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 23:31:36,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972214819] [2019-12-27 23:31:36,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:36,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:36,673 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 512 states and 880 transitions. [2019-12-27 23:31:36,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:36,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 92 times. [2019-12-27 23:31:36,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:31:36,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:36,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:31:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:31:36,682 INFO L87 Difference]: Start difference. First operand 749 states and 1631 transitions. Second operand 35 states. [2019-12-27 23:31:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:37,726 INFO L93 Difference]: Finished difference Result 1477 states and 3185 transitions. [2019-12-27 23:31:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 23:31:37,727 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-12-27 23:31:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:37,729 INFO L225 Difference]: With dead ends: 1477 [2019-12-27 23:31:37,729 INFO L226 Difference]: Without dead ends: 1264 [2019-12-27 23:31:37,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1362, Invalid=3330, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 23:31:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-12-27 23:31:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 762. [2019-12-27 23:31:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-12-27 23:31:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1657 transitions. [2019-12-27 23:31:37,744 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1657 transitions. Word has length 142 [2019-12-27 23:31:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:37,744 INFO L462 AbstractCegarLoop]: Abstraction has 762 states and 1657 transitions. [2019-12-27 23:31:37,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:31:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1657 transitions. [2019-12-27 23:31:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-27 23:31:37,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:37,746 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 23:31:37,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:37,949 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash -496752970, now seen corresponding path program 40 times [2019-12-27 23:31:37,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:37,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231197048] [2019-12-27 23:31:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:38,522 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 23:31:38,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231197048] [2019-12-27 23:31:38,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413308570] [2019-12-27 23:31:38,523 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:38,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:38,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:38,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 23:31:38,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:38,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:38,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:38,718 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 23:31:38,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:38,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 23:31:38,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504291812] [2019-12-27 23:31:38,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:38,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:39,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 516 states and 884 transitions. [2019-12-27 23:31:39,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:39,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 92 times. [2019-12-27 23:31:39,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 23:31:39,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 23:31:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 23:31:39,196 INFO L87 Difference]: Start difference. First operand 762 states and 1657 transitions. Second operand 36 states. [2019-12-27 23:31:40,198 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-12-27 23:31:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:40,370 INFO L93 Difference]: Finished difference Result 1509 states and 3249 transitions. [2019-12-27 23:31:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 23:31:40,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 146 [2019-12-27 23:31:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:40,372 INFO L225 Difference]: With dead ends: 1509 [2019-12-27 23:31:40,372 INFO L226 Difference]: Without dead ends: 1296 [2019-12-27 23:31:40,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1510, Invalid=3602, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 23:31:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-12-27 23:31:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 781. [2019-12-27 23:31:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-27 23:31:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1695 transitions. [2019-12-27 23:31:40,381 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1695 transitions. Word has length 146 [2019-12-27 23:31:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:40,382 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1695 transitions. [2019-12-27 23:31:40,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 23:31:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1695 transitions. [2019-12-27 23:31:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-27 23:31:40,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:40,383 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 23:31:40,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:40,585 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1399251027, now seen corresponding path program 41 times [2019-12-27 23:31:40,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:40,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913649897] [2019-12-27 23:31:40,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:41,122 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 23:31:41,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913649897] [2019-12-27 23:31:41,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812878349] [2019-12-27 23:31:41,123 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:41,214 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-12-27 23:31:41,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:41,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-27 23:31:41,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:41,260 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 23:31:41,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:41,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 23:31:41,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761840233] [2019-12-27 23:31:41,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:41,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:41,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 544 states and 936 transitions. [2019-12-27 23:31:41,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:41,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 98 times. [2019-12-27 23:31:41,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 23:31:41,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 23:31:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:31:41,721 INFO L87 Difference]: Start difference. First operand 781 states and 1695 transitions. Second operand 37 states. [2019-12-27 23:31:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:42,880 INFO L93 Difference]: Finished difference Result 1541 states and 3313 transitions. [2019-12-27 23:31:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 23:31:42,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 150 [2019-12-27 23:31:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:42,882 INFO L225 Difference]: With dead ends: 1541 [2019-12-27 23:31:42,882 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 23:31:42,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1531, Invalid=3725, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 23:31:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 23:31:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 794. [2019-12-27 23:31:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-27 23:31:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1721 transitions. [2019-12-27 23:31:42,894 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1721 transitions. Word has length 150 [2019-12-27 23:31:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:42,894 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1721 transitions. [2019-12-27 23:31:42,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 23:31:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1721 transitions. [2019-12-27 23:31:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-27 23:31:42,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:42,895 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 23:31:43,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:43,099 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1807539984, now seen corresponding path program 42 times [2019-12-27 23:31:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:43,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485925091] [2019-12-27 23:31:43,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:43,707 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 23:31:43,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485925091] [2019-12-27 23:31:43,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332920919] [2019-12-27 23:31:43,708 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:43,798 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-27 23:31:43,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:43,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 23:31:43,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:43,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:43,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:43,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:43,863 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 23:31:43,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:43,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 23:31:43,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882080466] [2019-12-27 23:31:43,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:44,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:44,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 548 states and 940 transitions. [2019-12-27 23:31:44,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:44,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 98 times. [2019-12-27 23:31:44,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 23:31:44,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:44,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 23:31:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 23:31:44,515 INFO L87 Difference]: Start difference. First operand 794 states and 1721 transitions. Second operand 38 states. [2019-12-27 23:31:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:46,067 INFO L93 Difference]: Finished difference Result 1573 states and 3377 transitions. [2019-12-27 23:31:46,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 23:31:46,067 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 154 [2019-12-27 23:31:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:46,070 INFO L225 Difference]: With dead ends: 1573 [2019-12-27 23:31:46,070 INFO L226 Difference]: Without dead ends: 1360 [2019-12-27 23:31:46,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1688, Invalid=4012, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 23:31:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-12-27 23:31:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 813. [2019-12-27 23:31:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-27 23:31:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1759 transitions. [2019-12-27 23:31:46,090 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1759 transitions. Word has length 154 [2019-12-27 23:31:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:46,091 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1759 transitions. [2019-12-27 23:31:46,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 23:31:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1759 transitions. [2019-12-27 23:31:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-27 23:31:46,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:46,092 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 23:31:46,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:46,297 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1165290893, now seen corresponding path program 43 times [2019-12-27 23:31:46,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:46,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504103827] [2019-12-27 23:31:46,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:46,880 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 23:31:46,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504103827] [2019-12-27 23:31:46,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800787323] [2019-12-27 23:31:46,880 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:46,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 23:31:46,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:46,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:47,025 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 23:31:47,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:47,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 23:31:47,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557907364] [2019-12-27 23:31:47,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:47,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:47,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 576 states and 992 transitions. [2019-12-27 23:31:47,734 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:47,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 104 times. [2019-12-27 23:31:47,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 23:31:47,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:47,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 23:31:47,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:31:47,739 INFO L87 Difference]: Start difference. First operand 813 states and 1759 transitions. Second operand 39 states. [2019-12-27 23:31:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:48,939 INFO L93 Difference]: Finished difference Result 1507 states and 3196 transitions. [2019-12-27 23:31:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 23:31:48,940 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 158 [2019-12-27 23:31:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:48,941 INFO L225 Difference]: With dead ends: 1507 [2019-12-27 23:31:48,941 INFO L226 Difference]: Without dead ends: 1376 [2019-12-27 23:31:48,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1705, Invalid=3995, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 23:31:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-12-27 23:31:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2019-12-27 23:31:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-12-27 23:31:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2885 transitions. [2019-12-27 23:31:48,954 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2885 transitions. Word has length 158 [2019-12-27 23:31:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:48,954 INFO L462 AbstractCegarLoop]: Abstraction has 1376 states and 2885 transitions. [2019-12-27 23:31:48,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 23:31:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2885 transitions. [2019-12-27 23:31:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-27 23:31:48,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:48,956 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 23:31:49,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:49,158 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash -200720086, now seen corresponding path program 44 times [2019-12-27 23:31:49,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:49,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462467750] [2019-12-27 23:31:49,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:49,728 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 23:31:49,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462467750] [2019-12-27 23:31:49,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81776440] [2019-12-27 23:31:49,729 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:49,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:49,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:49,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 23:31:49,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:49,857 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 23:31:49,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:49,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 23:31:49,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327723479] [2019-12-27 23:31:49,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:49,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:51,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 580 states and 996 transitions. [2019-12-27 23:31:51,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:51,082 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 104 times. [2019-12-27 23:31:51,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 23:31:51,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:51,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 23:31:51,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1253, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:31:51,083 INFO L87 Difference]: Start difference. First operand 1376 states and 2885 transitions. Second operand 40 states. [2019-12-27 23:31:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:52,382 INFO L93 Difference]: Finished difference Result 1621 states and 3473 transitions. [2019-12-27 23:31:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:31:52,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 162 [2019-12-27 23:31:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:52,384 INFO L225 Difference]: With dead ends: 1621 [2019-12-27 23:31:52,384 INFO L226 Difference]: Without dead ends: 1408 [2019-12-27 23:31:52,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1876, Invalid=4444, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 23:31:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-12-27 23:31:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2019-12-27 23:31:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2019-12-27 23:31:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2949 transitions. [2019-12-27 23:31:52,397 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2949 transitions. Word has length 162 [2019-12-27 23:31:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:52,397 INFO L462 AbstractCegarLoop]: Abstraction has 1408 states and 2949 transitions. [2019-12-27 23:31:52,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 23:31:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2949 transitions. [2019-12-27 23:31:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-27 23:31:52,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:52,399 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 23:31:52,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:52,599 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash -103308842, now seen corresponding path program 45 times [2019-12-27 23:31:52,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:52,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124077841] [2019-12-27 23:31:52,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:53,177 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 23:31:53,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124077841] [2019-12-27 23:31:53,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920252562] [2019-12-27 23:31:53,178 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:53,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-27 23:31:53,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:53,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 23:31:53,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:53,337 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 23:31:53,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:53,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 23:31:53,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899481354] [2019-12-27 23:31:53,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:53,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:54,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 592 states and 1020 transitions. [2019-12-27 23:31:54,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:54,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 107 times. [2019-12-27 23:31:54,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 23:31:54,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 23:31:54,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1252, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:31:54,255 INFO L87 Difference]: Start difference. First operand 1408 states and 2949 transitions. Second operand 40 states. [2019-12-27 23:31:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:55,465 INFO L93 Difference]: Finished difference Result 1555 states and 3292 transitions. [2019-12-27 23:31:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:31:55,466 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 162 [2019-12-27 23:31:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:55,468 INFO L225 Difference]: With dead ends: 1555 [2019-12-27 23:31:55,468 INFO L226 Difference]: Without dead ends: 1424 [2019-12-27 23:31:55,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1758, Invalid=4094, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 23:31:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-12-27 23:31:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 845. [2019-12-27 23:31:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-27 23:31:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1823 transitions. [2019-12-27 23:31:55,480 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1823 transitions. Word has length 162 [2019-12-27 23:31:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:55,480 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1823 transitions. [2019-12-27 23:31:55,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 23:31:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1823 transitions. [2019-12-27 23:31:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-27 23:31:55,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:55,482 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 23:31:55,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:55,686 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1520902343, now seen corresponding path program 46 times [2019-12-27 23:31:55,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:55,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772868064] [2019-12-27 23:31:55,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:56,259 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 23:31:56,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772868064] [2019-12-27 23:31:56,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233086102] [2019-12-27 23:31:56,260 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:56,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:56,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:56,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 23:31:56,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:56,405 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 23:31:56,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:56,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-12-27 23:31:56,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079173746] [2019-12-27 23:31:56,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:56,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:57,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 608 states and 1048 transitions. [2019-12-27 23:31:57,201 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:57,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 110 times. [2019-12-27 23:31:57,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 23:31:57,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 23:31:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 23:31:57,207 INFO L87 Difference]: Start difference. First operand 845 states and 1823 transitions. Second operand 41 states. [2019-12-27 23:31:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:58,701 INFO L93 Difference]: Finished difference Result 1571 states and 3324 transitions. [2019-12-27 23:31:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 23:31:58,701 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 166 [2019-12-27 23:31:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:58,703 INFO L225 Difference]: With dead ends: 1571 [2019-12-27 23:31:58,704 INFO L226 Difference]: Without dead ends: 1440 [2019-12-27 23:31:58,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1894, Invalid=4426, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 23:31:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-12-27 23:31:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2019-12-27 23:31:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-27 23:31:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3013 transitions. [2019-12-27 23:31:58,722 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3013 transitions. Word has length 166 [2019-12-27 23:31:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:58,722 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3013 transitions. [2019-12-27 23:31:58,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 23:31:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3013 transitions. [2019-12-27 23:31:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-27 23:31:58,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:58,725 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 23:31:58,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:58,929 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:58,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1395689316, now seen corresponding path program 47 times [2019-12-27 23:31:58,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:58,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19008994] [2019-12-27 23:31:58,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:59,578 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 23:31:59,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19008994] [2019-12-27 23:31:59,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883184048] [2019-12-27 23:31:59,579 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:59,670 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-27 23:31:59,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:59,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-27 23:31:59,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:59,749 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 23:31:59,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:59,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-27 23:31:59,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314101435] [2019-12-27 23:31:59,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:59,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:00,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 612 states and 1052 transitions. [2019-12-27 23:32:00,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:00,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 110 times. [2019-12-27 23:32:00,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 23:32:00,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 23:32:00,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 23:32:00,372 INFO L87 Difference]: Start difference. First operand 1440 states and 3013 transitions. Second operand 42 states. [2019-12-27 23:32:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:01,978 INFO L93 Difference]: Finished difference Result 1587 states and 3356 transitions. [2019-12-27 23:32:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:32:01,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 170 [2019-12-27 23:32:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:01,980 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 23:32:01,980 INFO L226 Difference]: Without dead ends: 1456 [2019-12-27 23:32:01,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2069, Invalid=4737, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 23:32:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-12-27 23:32:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 861. [2019-12-27 23:32:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-12-27 23:32:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1855 transitions. [2019-12-27 23:32:01,990 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1855 transitions. Word has length 170 [2019-12-27 23:32:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:01,990 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1855 transitions. [2019-12-27 23:32:01,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 23:32:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1855 transitions. [2019-12-27 23:32:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-27 23:32:01,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:01,991 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 23:32:02,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:02,192 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:02,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash -135682032, now seen corresponding path program 48 times [2019-12-27 23:32:02,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:02,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986898417] [2019-12-27 23:32:02,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:02,800 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 23:32:02,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986898417] [2019-12-27 23:32:02,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472077250] [2019-12-27 23:32:02,801 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:02,901 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-27 23:32:02,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:02,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-27 23:32:02,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:02,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:02,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:02,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:02,952 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 23:32:02,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:02,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-27 23:32:02,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661633078] [2019-12-27 23:32:02,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:02,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:03,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 624 states and 1076 transitions. [2019-12-27 23:32:03,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:03,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 113 times. [2019-12-27 23:32:03,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 23:32:03,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:03,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 23:32:03,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 23:32:03,612 INFO L87 Difference]: Start difference. First operand 861 states and 1855 transitions. Second operand 42 states. [2019-12-27 23:32:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:04,986 INFO L93 Difference]: Finished difference Result 1603 states and 3388 transitions. [2019-12-27 23:32:04,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:32:04,987 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 170 [2019-12-27 23:32:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:04,989 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 23:32:04,989 INFO L226 Difference]: Without dead ends: 1472 [2019-12-27 23:32:04,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1992, Invalid=4650, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 23:32:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-12-27 23:32:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1472. [2019-12-27 23:32:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2019-12-27 23:32:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 3077 transitions. [2019-12-27 23:32:05,003 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 3077 transitions. Word has length 170 [2019-12-27 23:32:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:05,003 INFO L462 AbstractCegarLoop]: Abstraction has 1472 states and 3077 transitions. [2019-12-27 23:32:05,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 23:32:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 3077 transitions. [2019-12-27 23:32:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-27 23:32:05,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:05,005 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 23:32:05,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:05,206 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:05,207 INFO L82 PathProgramCache]: Analyzing trace with hash 703887405, now seen corresponding path program 49 times [2019-12-27 23:32:05,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:05,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584890564] [2019-12-27 23:32:05,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:05,822 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 23:32:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584890564] [2019-12-27 23:32:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604408296] [2019-12-27 23:32:05,822 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:05,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-27 23:32:05,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:05,988 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 23:32:05,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:05,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-12-27 23:32:05,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584435003] [2019-12-27 23:32:05,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:06,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:06,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 628 states and 1080 transitions. [2019-12-27 23:32:06,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:06,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 113 times. [2019-12-27 23:32:06,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 23:32:06,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 23:32:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:32:06,885 INFO L87 Difference]: Start difference. First operand 1472 states and 3077 transitions. Second operand 43 states. [2019-12-27 23:32:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:08,319 INFO L93 Difference]: Finished difference Result 1619 states and 3420 transitions. [2019-12-27 23:32:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:32:08,319 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2019-12-27 23:32:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:08,320 INFO L225 Difference]: With dead ends: 1619 [2019-12-27 23:32:08,320 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 23:32:08,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2172, Invalid=4968, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 23:32:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 23:32:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 877. [2019-12-27 23:32:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-27 23:32:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1887 transitions. [2019-12-27 23:32:08,332 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1887 transitions. Word has length 174 [2019-12-27 23:32:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:08,333 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1887 transitions. [2019-12-27 23:32:08,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 23:32:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1887 transitions. [2019-12-27 23:32:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-27 23:32:08,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:08,334 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 23:32:08,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:08,535 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1467447809, now seen corresponding path program 50 times [2019-12-27 23:32:08,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:08,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229854074] [2019-12-27 23:32:08,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:09,178 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 23:32:09,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229854074] [2019-12-27 23:32:09,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800355847] [2019-12-27 23:32:09,178 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:09,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:32:09,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:09,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-27 23:32:09,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:09,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:09,341 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 23:32:09,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:09,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-12-27 23:32:09,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1864111618] [2019-12-27 23:32:09,342 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:09,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:10,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 640 states and 1104 transitions. [2019-12-27 23:32:10,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:10,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 116 times. [2019-12-27 23:32:10,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 23:32:10,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 23:32:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:32:10,052 INFO L87 Difference]: Start difference. First operand 877 states and 1887 transitions. Second operand 43 states. [2019-12-27 23:32:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:11,486 INFO L93 Difference]: Finished difference Result 1635 states and 3452 transitions. [2019-12-27 23:32:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:32:11,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2019-12-27 23:32:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:11,488 INFO L225 Difference]: With dead ends: 1635 [2019-12-27 23:32:11,488 INFO L226 Difference]: Without dead ends: 1504 [2019-12-27 23:32:11,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2093, Invalid=4879, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 23:32:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-12-27 23:32:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2019-12-27 23:32:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-12-27 23:32:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 3141 transitions. [2019-12-27 23:32:11,511 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 3141 transitions. Word has length 174 [2019-12-27 23:32:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:11,511 INFO L462 AbstractCegarLoop]: Abstraction has 1504 states and 3141 transitions. [2019-12-27 23:32:11,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 23:32:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 3141 transitions. [2019-12-27 23:32:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-27 23:32:11,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:11,514 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 23:32:11,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:11,718 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:11,718 INFO L82 PathProgramCache]: Analyzing trace with hash -382536802, now seen corresponding path program 51 times [2019-12-27 23:32:11,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:11,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872386237] [2019-12-27 23:32:11,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:12,356 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 23:32:12,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872386237] [2019-12-27 23:32:12,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462577420] [2019-12-27 23:32:12,357 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:12,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-12-27 23:32:12,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:12,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-27 23:32:12,459 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:12,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:12,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:12,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:12,509 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 23:32:12,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:12,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-12-27 23:32:12,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1178577063] [2019-12-27 23:32:12,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:12,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:13,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 644 states and 1108 transitions. [2019-12-27 23:32:13,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:13,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 116 times. [2019-12-27 23:32:13,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-27 23:32:13,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-27 23:32:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=1511, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:32:13,203 INFO L87 Difference]: Start difference. First operand 1504 states and 3141 transitions. Second operand 44 states. [2019-12-27 23:32:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:14,660 INFO L93 Difference]: Finished difference Result 1651 states and 3484 transitions. [2019-12-27 23:32:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 23:32:14,660 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 178 [2019-12-27 23:32:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:14,662 INFO L225 Difference]: With dead ends: 1651 [2019-12-27 23:32:14,662 INFO L226 Difference]: Without dead ends: 1520 [2019-12-27 23:32:14,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2277, Invalid=5205, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 23:32:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-12-27 23:32:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 893. [2019-12-27 23:32:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-12-27 23:32:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1919 transitions. [2019-12-27 23:32:14,673 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1919 transitions. Word has length 178 [2019-12-27 23:32:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:14,673 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1919 transitions. [2019-12-27 23:32:14,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-27 23:32:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1919 transitions. [2019-12-27 23:32:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-27 23:32:14,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:14,674 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 23:32:14,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:14,875 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash -166276022, now seen corresponding path program 52 times [2019-12-27 23:32:14,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:14,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130124816] [2019-12-27 23:32:14,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:32:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:32:15,031 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:32:15,031 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:32:15,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:32:15 BasicIcfg [2019-12-27 23:32:15,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:32:15,218 INFO L168 Benchmark]: Toolchain (without parser) took 97019.19 ms. Allocated memory was 146.8 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 101.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,219 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.80 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 162.3 MB in the end (delta: -60.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.45 ms. Allocated memory is still 203.9 MB. Free memory was 162.3 MB in the beginning and 160.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,220 INFO L168 Benchmark]: Boogie Preprocessor took 25.22 ms. Allocated memory is still 203.9 MB. Free memory was 160.4 MB in the beginning and 159.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,220 INFO L168 Benchmark]: RCFGBuilder took 391.32 ms. Allocated memory is still 203.9 MB. Free memory was 159.1 MB in the beginning and 139.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,220 INFO L168 Benchmark]: TraceAbstraction took 95841.20 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 139.3 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:15,223 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.80 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 162.3 MB in the end (delta: -60.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.45 ms. Allocated memory is still 203.9 MB. Free memory was 162.3 MB in the beginning and 160.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.22 ms. Allocated memory is still 203.9 MB. Free memory was 160.4 MB in the beginning and 159.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 391.32 ms. Allocated memory is still 203.9 MB. Free memory was 159.1 MB in the beginning and 139.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95841.20 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 139.3 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 44.5 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=1, k=0] [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=1, k=2] [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=1, k=2] [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=3, k=2] [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=4, 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=13, j=14, k=4, k=3] [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=4, k=5] [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=6, k=5] [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=6, k=5] [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=6, k=7] [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=9, 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=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=10, k=11] [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=12, k=11] [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=13, k=12] [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=13, 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=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=17, 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=39, j=40, k=17, k=16] [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=18, 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=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=18, 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=43, j=44, k=18, k=19] [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: 95.5s, OverallIterations: 58, TraceHistogramMax: 20, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2884 SDtfs, 17550 SDslu, 29076 SDs, 0 SdLazy, 5504 SolverSat, 4801 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11374 GetRequests, 8822 SyntacticMatches, 0 SemanticMatches, 2552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27859 ImplicationChecksByTransitivity, 46.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1504occurred in iteration=56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 57 MinimizatonAttempts, 10450 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 11298 NumberOfCodeBlocks, 11298 NumberOfCodeBlocksAsserted, 391 NumberOfCheckSat, 11010 ConstructedInterpolants, 0 QuantifiedInterpolants, 4010670 SizeOfPredicates, 1299 NumberOfNonLiveVariables, 12565 ConjunctsInSsa, 1475 ConjunctsInUnsatCore, 110 InterpolantComputations, 4 PerfectInterpolantSequences, 0/51428 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...