/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:10:50,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:10:50,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:10:50,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:10:50,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:10:50,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:10:50,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:10:50,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:10:50,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:10:50,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:10:50,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:10:50,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:10:50,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:10:50,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:10:50,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:10:50,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:10:50,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:10:50,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:10:50,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:10:50,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:10:50,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:10:50,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:10:50,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:10:50,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:10:50,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:10:50,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:10:50,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:10:50,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:10:50,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:10:50,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:10:50,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:10:50,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:10:50,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:10:50,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:10:50,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:10:50,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:10:50,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:10:50,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:10:50,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:10:50,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:10:50,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:10:50,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:10:50,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:10:50,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:10:50,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:10:50,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:10:50,186 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:10:50,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:10:50,187 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:10:50,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:10:50,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:10:50,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:10:50,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:10:50,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:10:50,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:10:50,188 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:10:50,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:10:50,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:10:50,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:10:50,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:10:50,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:10:50,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:10:50,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:10:50,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:10:50,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:10:50,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:10:50,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:10:50,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:10:50,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:10:50,191 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:10:50,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:10:50,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:10:50,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:10:50,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:10:50,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:10:50,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:10:50,514 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:10:50,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-18 23:10:50,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722a7ff29/c6107f127e5c4524b5cd0cb8e8db4c24/FLAG9878e30b8 [2019-12-18 23:10:51,132 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:10:51,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-18 23:10:51,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722a7ff29/c6107f127e5c4524b5cd0cb8e8db4c24/FLAG9878e30b8 [2019-12-18 23:10:51,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/722a7ff29/c6107f127e5c4524b5cd0cb8e8db4c24 [2019-12-18 23:10:51,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:10:51,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:10:51,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:10:51,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:10:51,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:10:51,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:10:51" (1/1) ... [2019-12-18 23:10:51,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f4e514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:51, skipping insertion in model container [2019-12-18 23:10:51,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:10:51" (1/1) ... [2019-12-18 23:10:51,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:10:51,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:10:52,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:10:52,102 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:10:52,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:10:52,270 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:10:52,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52 WrapperNode [2019-12-18 23:10:52,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:10:52,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:10:52,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:10:52,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:10:52,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:10:52,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:10:52,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:10:52,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:10:52,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:10:52,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:10:52,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:10:52,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:10:52,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (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-18 23:10:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 23:10:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 23:10:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 23:10:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 23:10:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:10:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:10:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:10:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:10:52,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:10:52,422 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:10:52,742 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:10:52,742 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 23:10:52,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:10:52 BoogieIcfgContainer [2019-12-18 23:10:52,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:10:52,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:10:52,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:10:52,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:10:52,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:10:51" (1/3) ... [2019-12-18 23:10:52,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:10:52, skipping insertion in model container [2019-12-18 23:10:52,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52" (2/3) ... [2019-12-18 23:10:52,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:10:52, skipping insertion in model container [2019-12-18 23:10:52,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:10:52" (3/3) ... [2019-12-18 23:10:52,752 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2019-12-18 23:10:52,763 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:10:52,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:10:52,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 23:10:52,770 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:10:52,797 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,797 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,799 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,800 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,800 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,807 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,808 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,809 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,818 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,819 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,819 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,819 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,819 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,819 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,832 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 23:10:52,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:52,850 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:52,850 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:52,850 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:52,850 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:52,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:52,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:52,851 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:52,865 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-18 23:10:52,867 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 23:10:52,911 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 23:10:52,911 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:52,918 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 8/63 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 23:10:52,922 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 23:10:52,941 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 23:10:52,942 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:52,946 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 8/63 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 23:10:52,950 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 23:10:52,952 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:54,174 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:10:54,299 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 23:10:54,299 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-18 23:10:54,303 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 23:10:54,313 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 23:10:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 23:10:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:54,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:54,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:54,324 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-18 23:10:54,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:54,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405359421] [2019-12-18 23:10:54,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:54,570 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-18 23:10:54,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405359421] [2019-12-18 23:10:54,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:54,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:54,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887107714] [2019-12-18 23:10:54,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:54,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:54,598 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 23:10:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:54,632 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 23:10:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:54,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:54,649 INFO L225 Difference]: With dead ends: 35 [2019-12-18 23:10:54,649 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 23:10:54,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 23:10:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 23:10:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 23:10:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 23:10:54,685 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 23:10:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:54,686 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 23:10:54,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 23:10:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 23:10:54,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:54,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:54,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-18 23:10:54,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:54,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415674645] [2019-12-18 23:10:54,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:54,846 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-18 23:10:54,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415674645] [2019-12-18 23:10:54,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:54,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:10:54,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137006102] [2019-12-18 23:10:54,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:10:54,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:10:54,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:10:54,851 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 23:10:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:54,872 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 23:10:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:10:54,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 23:10:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:54,874 INFO L225 Difference]: With dead ends: 26 [2019-12-18 23:10:54,874 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 23:10:54,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:10:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 23:10:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 23:10:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 23:10:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 23:10:54,884 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 23:10:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:54,885 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 23:10:54,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:10:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 23:10:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 23:10:54,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:54,887 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:54,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-18 23:10:54,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:54,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271508408] [2019-12-18 23:10:54,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:54,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:54,974 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:54,975 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:54,975 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 23:10:54,991 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,992 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,993 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,993 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,993 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,993 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,994 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,994 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,995 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,995 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,995 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,995 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,997 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,997 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,997 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,997 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,998 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,998 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,007 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,007 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,008 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,008 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,008 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,011 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,011 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,012 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,012 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,012 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:55,024 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:10:55,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:55,025 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:55,025 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:55,025 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:55,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:55,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:55,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:55,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:55,029 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-18 23:10:55,031 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 23:10:55,058 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 23:10:55,058 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:55,061 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 20/95 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-18 23:10:55,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 23:10:55,081 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 23:10:55,081 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:55,083 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 20/95 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-18 23:10:55,088 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 23:10:55,088 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:56,131 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 23:10:56,433 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-18 23:10:56,433 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-18 23:10:56,434 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 23:10:56,445 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 23:10:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 23:10:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:56,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:56,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-18 23:10:56,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764221806] [2019-12-18 23:10:56,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,507 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-18 23:10:56,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764221806] [2019-12-18 23:10:56,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:56,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:56,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145665414] [2019-12-18 23:10:56,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:56,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:56,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:56,513 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 23:10:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,542 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 23:10:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:56,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,549 INFO L225 Difference]: With dead ends: 185 [2019-12-18 23:10:56,552 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 23:10:56,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 23:10:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 23:10:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 23:10:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 23:10:56,591 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 23:10:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,592 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 23:10:56,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 23:10:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:10:56,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-18 23:10:56,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007867714] [2019-12-18 23:10:56,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,645 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-18 23:10:56,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007867714] [2019-12-18 23:10:56,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:56,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:56,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070930391] [2019-12-18 23:10:56,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:56,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:56,647 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 23:10:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,712 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-18 23:10:56,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:56,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:10:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,721 INFO L225 Difference]: With dead ends: 204 [2019-12-18 23:10:56,721 INFO L226 Difference]: Without dead ends: 201 [2019-12-18 23:10:56,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-18 23:10:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-18 23:10:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 23:10:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 23:10:56,753 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 23:10:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,753 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 23:10:56,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 23:10:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:10:56,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,755 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-18 23:10:56,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792674460] [2019-12-18 23:10:56,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:56,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792674460] [2019-12-18 23:10:56,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:56,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:56,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625868710] [2019-12-18 23:10:56,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:56,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:56,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:56,845 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 23:10:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,906 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-18 23:10:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:56,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:10:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,908 INFO L225 Difference]: With dead ends: 189 [2019-12-18 23:10:56,909 INFO L226 Difference]: Without dead ends: 185 [2019-12-18 23:10:56,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-18 23:10:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-18 23:10:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 23:10:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 23:10:56,920 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 23:10:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,922 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 23:10:56,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 23:10:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:10:56,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,923 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-18 23:10:56,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806245168] [2019-12-18 23:10:56,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:56,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:56,954 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:56,954 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:56,954 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 23:10:56,965 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,965 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,965 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,965 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,965 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,966 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,966 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,970 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,970 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,970 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,971 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,972 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,973 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,973 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,974 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,988 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:10:56,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:56,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:56,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:56,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:56,989 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:56,989 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:56,989 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:56,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:56,991 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-18 23:10:56,991 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 23:10:57,010 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 23:10:57,011 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:57,013 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 23:10:57,017 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 23:10:57,047 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 23:10:57,047 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:57,050 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 23:10:57,054 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 23:10:57,054 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:58,463 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:10:58,530 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-18 23:10:58,530 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-18 23:10:58,530 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 23:10:58,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 23:10:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 23:10:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:58,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:58,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-18 23:10:58,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119459427] [2019-12-18 23:10:58,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:58,585 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-18 23:10:58,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119459427] [2019-12-18 23:10:58,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:58,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:58,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58101962] [2019-12-18 23:10:58,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:58,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:58,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:58,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:58,587 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 23:10:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:58,616 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 23:10:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:58,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:58,623 INFO L225 Difference]: With dead ends: 600 [2019-12-18 23:10:58,623 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 23:10:58,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 23:10:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 23:10:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 23:10:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 23:10:58,653 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 23:10:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:58,653 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 23:10:58,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 23:10:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:10:58,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:58,654 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-18 23:10:58,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117745355] [2019-12-18 23:10:58,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:58,699 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-18 23:10:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117745355] [2019-12-18 23:10:58,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:58,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:58,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957410123] [2019-12-18 23:10:58,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:58,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:58,702 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 23:10:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:58,794 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-18 23:10:58,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:58,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:10:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:58,800 INFO L225 Difference]: With dead ends: 802 [2019-12-18 23:10:58,800 INFO L226 Difference]: Without dead ends: 799 [2019-12-18 23:10:58,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-18 23:10:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-18 23:10:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 23:10:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 23:10:58,825 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 23:10:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:58,825 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 23:10:58,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 23:10:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:10:58,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,826 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:58,827 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-18 23:10:58,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641998862] [2019-12-18 23:10:58,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:58,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641998862] [2019-12-18 23:10:58,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:58,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:58,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135480224] [2019-12-18 23:10:58,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:58,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:58,864 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 23:10:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:58,939 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-18 23:10:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:58,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:10:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:58,945 INFO L225 Difference]: With dead ends: 832 [2019-12-18 23:10:58,946 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 23:10:58,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 23:10:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-18 23:10:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 23:10:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 23:10:58,970 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 23:10:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:58,971 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 23:10:58,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 23:10:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:10:58,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,972 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:58,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-18 23:10:58,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371903263] [2019-12-18 23:10:58,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:59,040 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-18 23:10:59,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371903263] [2019-12-18 23:10:59,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629490805] [2019-12-18 23:10:59,041 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-18 23:10:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:59,175 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:10:59,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:10:59,235 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-18 23:10:59,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:10:59,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 23:10:59,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683082419] [2019-12-18 23:10:59,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:10:59,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:10:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:10:59,237 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-18 23:10:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:59,462 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-18 23:10:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:10:59,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 23:10:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:59,471 INFO L225 Difference]: With dead ends: 1052 [2019-12-18 23:10:59,471 INFO L226 Difference]: Without dead ends: 1048 [2019-12-18 23:10:59,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:10:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-18 23:10:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-18 23:10:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-18 23:10:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-18 23:10:59,529 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-18 23:10:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:59,529 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-18 23:10:59,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:10:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-18 23:10:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:10:59,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:59,531 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:59,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:10:59,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-18 23:10:59,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:59,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625773174] [2019-12-18 23:10:59,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:59,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625773174] [2019-12-18 23:10:59,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:59,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:10:59,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784427889] [2019-12-18 23:10:59,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:10:59,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:59,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:10:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:59,796 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-18 23:10:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:59,977 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-18 23:10:59,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:10:59,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:10:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:59,985 INFO L225 Difference]: With dead ends: 1050 [2019-12-18 23:10:59,985 INFO L226 Difference]: Without dead ends: 1045 [2019-12-18 23:10:59,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:10:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-18 23:11:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-18 23:11:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 23:11:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-18 23:11:00,008 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-18 23:11:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,009 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-18 23:11:00,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-18 23:11:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:00,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,011 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:00,012 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-18 23:11:00,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810819806] [2019-12-18 23:11:00,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:00,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810819806] [2019-12-18 23:11:00,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:00,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:00,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157025402] [2019-12-18 23:11:00,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:00,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:00,087 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-18 23:11:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:00,142 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-18 23:11:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:00,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:00,148 INFO L225 Difference]: With dead ends: 736 [2019-12-18 23:11:00,148 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 23:11:00,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 23:11:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-18 23:11:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 23:11:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-18 23:11:00,167 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-18 23:11:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,167 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-18 23:11:00,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-18 23:11:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:11:00,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,169 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:00,169 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-18 23:11:00,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84273089] [2019-12-18 23:11:00,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:00,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:11:00,213 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:11:00,213 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:11:00,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 23:11:00,229 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,229 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,229 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,229 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,229 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,230 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,230 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,230 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,230 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,231 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,231 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,231 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,231 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,232 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,232 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,232 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,233 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,234 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,234 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,235 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,236 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,244 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,244 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,244 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,244 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,244 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,246 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,246 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,247 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,247 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,248 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,248 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,248 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,249 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,249 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,249 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,249 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,249 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,251 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,251 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,252 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,252 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,252 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,252 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,253 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,253 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,267 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,267 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,267 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,268 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,268 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,268 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,270 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,270 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,270 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,270 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,270 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,270 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:00,272 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 23:11:00,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:11:00,272 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:11:00,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:11:00,273 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:11:00,273 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:11:00,273 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:11:00,273 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:11:00,273 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:11:00,274 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-18 23:11:00,274 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 23:11:00,289 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 23:11:00,289 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:00,291 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 56/171 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-18 23:11:00,296 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 23:11:00,309 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 23:11:00,310 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:00,311 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 56/171 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-18 23:11:00,316 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 23:11:00,316 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:02,147 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-18 23:11:02,147 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-18 23:11:02,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 23:11:02,257 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 23:11:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 23:11:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:11:02,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:02,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:11:02,258 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-18 23:11:02,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:02,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313448322] [2019-12-18 23:11:02,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,273 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-18 23:11:02,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313448322] [2019-12-18 23:11:02,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:02,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:11:02,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091738889] [2019-12-18 23:11:02,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:11:02,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:11:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:02,276 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 23:11:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:02,332 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 23:11:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:11:02,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:11:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:02,350 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 23:11:02,351 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 23:11:02,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 23:11:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 23:11:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 23:11:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 23:11:02,415 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 23:11:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:02,416 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 23:11:02,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:11:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 23:11:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:11:02,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:02,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:02,417 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:02,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-18 23:11:02,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:02,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036009742] [2019-12-18 23:11:02,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,451 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-18 23:11:02,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036009742] [2019-12-18 23:11:02,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:02,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:02,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279118197] [2019-12-18 23:11:02,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:02,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:02,453 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 23:11:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:02,526 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-18 23:11:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:02,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:11:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:02,549 INFO L225 Difference]: With dead ends: 2826 [2019-12-18 23:11:02,549 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 23:11:02,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 23:11:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-18 23:11:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 23:11:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 23:11:02,633 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 23:11:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:02,634 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 23:11:02,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 23:11:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:11:02,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:02,635 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:02,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-18 23:11:02,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:02,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977177638] [2019-12-18 23:11:02,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:02,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977177638] [2019-12-18 23:11:02,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:02,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:02,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162549201] [2019-12-18 23:11:02,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:02,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:02,681 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 23:11:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:02,774 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-18 23:11:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:02,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:11:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:02,817 INFO L225 Difference]: With dead ends: 3124 [2019-12-18 23:11:02,818 INFO L226 Difference]: Without dead ends: 3120 [2019-12-18 23:11:02,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-18 23:11:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-18 23:11:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 23:11:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 23:11:02,913 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 23:11:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:02,915 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 23:11:02,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 23:11:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:02,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:02,916 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:02,917 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-18 23:11:02,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:02,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433275297] [2019-12-18 23:11:02,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,969 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-18 23:11:02,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433275297] [2019-12-18 23:11:02,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041231329] [2019-12-18 23:11:02,969 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-18 23:11:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:03,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:03,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:03,054 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-18 23:11:03,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:03,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:03,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234465149] [2019-12-18 23:11:03,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:03,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:03,056 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 7 states. [2019-12-18 23:11:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:03,279 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-18 23:11:03,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:03,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:03,299 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 23:11:03,300 INFO L226 Difference]: Without dead ends: 4456 [2019-12-18 23:11:03,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-18 23:11:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-18 23:11:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-18 23:11:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-18 23:11:03,434 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-18 23:11:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:03,435 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-18 23:11:03,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-18 23:11:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:03,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:03,436 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:03,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:03,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-18 23:11:03,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:03,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417451608] [2019-12-18 23:11:03,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:03,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417451608] [2019-12-18 23:11:03,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:03,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:03,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872184600] [2019-12-18 23:11:03,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:03,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:03,694 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-18 23:11:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:03,875 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-18 23:11:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:03,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:03,889 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 23:11:03,889 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 23:11:03,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 23:11:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-18 23:11:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 23:11:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 23:11:03,980 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 23:11:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:03,980 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 23:11:03,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 23:11:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:03,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:03,982 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:03,982 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:03,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-18 23:11:03,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:03,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200818062] [2019-12-18 23:11:03,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:04,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200818062] [2019-12-18 23:11:04,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:04,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:04,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358985524] [2019-12-18 23:11:04,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:04,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:04,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:04,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:04,023 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 23:11:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:04,094 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-18 23:11:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:04,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:04,106 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 23:11:04,106 INFO L226 Difference]: Without dead ends: 3200 [2019-12-18 23:11:04,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-18 23:11:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-18 23:11:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 23:11:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 23:11:04,180 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 23:11:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:04,180 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 23:11:04,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 23:11:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:04,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:04,182 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:04,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-18 23:11:04,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:04,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274195896] [2019-12-18 23:11:04,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:04,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274195896] [2019-12-18 23:11:04,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015789930] [2019-12-18 23:11:04,225 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-18 23:11:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:04,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:04,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:04,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:04,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:04,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769689378] [2019-12-18 23:11:04,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:04,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:04,307 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 7 states. [2019-12-18 23:11:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:04,562 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-18 23:11:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:04,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:04,581 INFO L225 Difference]: With dead ends: 4759 [2019-12-18 23:11:04,581 INFO L226 Difference]: Without dead ends: 4753 [2019-12-18 23:11:04,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-18 23:11:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-18 23:11:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-18 23:11:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-18 23:11:04,670 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-18 23:11:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:04,670 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-18 23:11:04,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-18 23:11:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:04,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:04,672 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:04,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:04,880 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-18 23:11:04,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:04,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364788121] [2019-12-18 23:11:04,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:04,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364788121] [2019-12-18 23:11:04,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307729484] [2019-12-18 23:11:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:05,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:05,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:05,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:05,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:05,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965844075] [2019-12-18 23:11:05,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:05,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:05,026 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 7 states. [2019-12-18 23:11:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:05,266 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-18 23:11:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:05,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:05,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:05,290 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 23:11:05,290 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 23:11:05,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 23:11:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-18 23:11:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 23:11:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-18 23:11:05,386 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-18 23:11:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:05,386 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-18 23:11:05,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-18 23:11:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:05,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:05,388 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:05,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:05,592 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-18 23:11:05,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:05,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903281325] [2019-12-18 23:11:05,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:05,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903281325] [2019-12-18 23:11:05,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:05,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:05,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145524507] [2019-12-18 23:11:05,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:05,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:05,640 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-18 23:11:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:05,821 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-18 23:11:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:05,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:05,839 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 23:11:05,839 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 23:11:05,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 23:11:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-18 23:11:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-18 23:11:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-18 23:11:05,918 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-18 23:11:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:05,919 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-18 23:11:05,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-18 23:11:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:05,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:05,920 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:05,921 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-18 23:11:05,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:05,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154750517] [2019-12-18 23:11:05,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:06,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154750517] [2019-12-18 23:11:06,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:06,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:06,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951396932] [2019-12-18 23:11:06,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:06,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:06,059 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-18 23:11:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:06,430 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-18 23:11:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:06,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:06,446 INFO L225 Difference]: With dead ends: 4737 [2019-12-18 23:11:06,446 INFO L226 Difference]: Without dead ends: 4728 [2019-12-18 23:11:06,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-18 23:11:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-18 23:11:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 23:11:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-18 23:11:06,526 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-18 23:11:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:06,526 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-18 23:11:06,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-18 23:11:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:06,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:06,529 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:06,529 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-18 23:11:06,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:06,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033667684] [2019-12-18 23:11:06,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:06,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033667684] [2019-12-18 23:11:06,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129659534] [2019-12-18 23:11:06,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:06,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:06,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:06,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:06,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139152460] [2019-12-18 23:11:06,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:06,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:06,703 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 9 states. [2019-12-18 23:11:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:07,219 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-18 23:11:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:07,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:07,232 INFO L225 Difference]: With dead ends: 5995 [2019-12-18 23:11:07,232 INFO L226 Difference]: Without dead ends: 5991 [2019-12-18 23:11:07,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-18 23:11:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-18 23:11:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-18 23:11:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-18 23:11:07,321 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-18 23:11:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:07,322 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-18 23:11:07,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-18 23:11:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:07,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:07,324 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:07,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:07,527 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-18 23:11:07,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:07,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115154808] [2019-12-18 23:11:07,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:07,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115154808] [2019-12-18 23:11:07,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026914494] [2019-12-18 23:11:07,595 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:07,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:07,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:07,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:07,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:07,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:07,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:07,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23575900] [2019-12-18 23:11:07,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:07,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:07,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:07,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:07,726 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 9 states. [2019-12-18 23:11:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:08,246 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-18 23:11:08,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:08,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:08,255 INFO L225 Difference]: With dead ends: 5889 [2019-12-18 23:11:08,255 INFO L226 Difference]: Without dead ends: 5883 [2019-12-18 23:11:08,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-18 23:11:08,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-18 23:11:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-18 23:11:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-18 23:11:08,334 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-18 23:11:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:08,334 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-18 23:11:08,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-18 23:11:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:08,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:08,337 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:08,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:08,549 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-18 23:11:08,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:08,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659745420] [2019-12-18 23:11:08,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659745420] [2019-12-18 23:11:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747941253] [2019-12-18 23:11:08,631 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:08,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:11:08,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:08,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:08,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:08,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:08,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:08,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217319906] [2019-12-18 23:11:08,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:08,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:08,716 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 9 states. [2019-12-18 23:11:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:09,242 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-18 23:11:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:09,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:09,258 INFO L225 Difference]: With dead ends: 5888 [2019-12-18 23:11:09,258 INFO L226 Difference]: Without dead ends: 5884 [2019-12-18 23:11:09,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-18 23:11:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-18 23:11:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-18 23:11:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-18 23:11:09,351 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-18 23:11:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:09,351 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-18 23:11:09,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-18 23:11:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:09,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:09,357 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:09,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:09,561 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-18 23:11:09,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:09,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494759707] [2019-12-18 23:11:09,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:09,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494759707] [2019-12-18 23:11:09,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593479746] [2019-12-18 23:11:09,696 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 23:11:09,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:09,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:09,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:09,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:09,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:09,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:09,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436146232] [2019-12-18 23:11:09,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:09,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:09,801 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 9 states. [2019-12-18 23:11:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:10,331 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-18 23:11:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:10,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:10,344 INFO L225 Difference]: With dead ends: 5819 [2019-12-18 23:11:10,344 INFO L226 Difference]: Without dead ends: 5813 [2019-12-18 23:11:10,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-18 23:11:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-18 23:11:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-18 23:11:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-18 23:11:10,394 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-18 23:11:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:10,395 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-18 23:11:10,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-18 23:11:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:10,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:10,397 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:10,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:10,600 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-18 23:11:10,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:10,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761713509] [2019-12-18 23:11:10,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:10,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761713509] [2019-12-18 23:11:10,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:10,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:10,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281204445] [2019-12-18 23:11:10,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:10,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:10,634 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-18 23:11:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:10,710 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-18 23:11:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:10,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:11:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:10,717 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 23:11:10,717 INFO L226 Difference]: Without dead ends: 2994 [2019-12-18 23:11:10,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-18 23:11:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-18 23:11:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-18 23:11:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-18 23:11:10,769 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-18 23:11:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:10,769 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-18 23:11:10,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-18 23:11:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:10,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:10,771 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:10,771 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:10,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-18 23:11:10,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:10,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342030323] [2019-12-18 23:11:10,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:10,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342030323] [2019-12-18 23:11:10,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:10,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:10,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146900447] [2019-12-18 23:11:10,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:10,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:10,835 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-18 23:11:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:11,322 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-18 23:11:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:11,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:11,333 INFO L225 Difference]: With dead ends: 6140 [2019-12-18 23:11:11,333 INFO L226 Difference]: Without dead ends: 6133 [2019-12-18 23:11:11,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-18 23:11:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-18 23:11:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-18 23:11:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-18 23:11:11,431 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-18 23:11:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:11,432 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-18 23:11:11,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-18 23:11:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:11,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:11,434 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:11,434 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-18 23:11:11,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:11,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073721071] [2019-12-18 23:11:11,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:11,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073721071] [2019-12-18 23:11:11,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:11,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:11,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497015476] [2019-12-18 23:11:11,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:11,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:11,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:11,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:11,566 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-18 23:11:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:12,040 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-18 23:11:12,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:12,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:12,049 INFO L225 Difference]: With dead ends: 6012 [2019-12-18 23:11:12,050 INFO L226 Difference]: Without dead ends: 6002 [2019-12-18 23:11:12,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-18 23:11:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-18 23:11:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-18 23:11:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-18 23:11:12,124 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-18 23:11:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:12,125 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-18 23:11:12,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-18 23:11:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:11:12,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:12,127 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:12,127 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-18 23:11:12,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:12,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407248169] [2019-12-18 23:11:12,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:12,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:11:12,150 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:11:12,150 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:11:12,150 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 23:11:12,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,164 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,166 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,167 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,167 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,167 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,167 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,167 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,167 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,168 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,175 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,175 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,175 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,177 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,177 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,177 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,177 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,177 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,177 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,178 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,179 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,179 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,179 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,179 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,179 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,180 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,182 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,183 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,184 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,184 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,184 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,184 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,184 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,185 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,186 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,186 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,186 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,186 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,191 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,191 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,192 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,192 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,192 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,192 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,193 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,193 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,193 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,193 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,193 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,193 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,194 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,194 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,194 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,194 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,195 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,195 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:12,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 23:11:12,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:11:12,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:11:12,196 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:11:12,196 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:11:12,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:11:12,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:11:12,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:11:12,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:11:12,198 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-18 23:11:12,198 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 23:11:12,215 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 23:11:12,215 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:12,218 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 80/215 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-18 23:11:12,225 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 23:11:12,241 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 23:11:12,241 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:12,243 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 80/215 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-18 23:11:12,250 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-18 23:11:12,250 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:13,593 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 23:11:14,034 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-18 23:11:14,034 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 23:11:14,034 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 23:11:14,310 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 23:11:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 23:11:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:11:14,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:14,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:11:14,311 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-18 23:11:14,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:14,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322621695] [2019-12-18 23:11:14,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:14,330 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-18 23:11:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322621695] [2019-12-18 23:11:14,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:14,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:11:14,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317044081] [2019-12-18 23:11:14,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:11:14,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:11:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:14,332 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 23:11:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:14,405 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 23:11:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:11:14,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:11:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:14,423 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 23:11:14,423 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 23:11:14,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 23:11:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 23:11:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 23:11:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 23:11:14,560 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 23:11:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:14,560 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 23:11:14,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:11:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 23:11:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:11:14,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:14,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:14,561 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-18 23:11:14,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:14,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156054217] [2019-12-18 23:11:14,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:14,593 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-18 23:11:14,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156054217] [2019-12-18 23:11:14,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:14,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:14,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559213240] [2019-12-18 23:11:14,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:14,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:14,595 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 23:11:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:14,830 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-18 23:11:14,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:14,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:11:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:14,863 INFO L225 Difference]: With dead ends: 9358 [2019-12-18 23:11:14,863 INFO L226 Difference]: Without dead ends: 9355 [2019-12-18 23:11:14,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-18 23:11:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-18 23:11:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 23:11:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 23:11:15,070 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 23:11:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:15,070 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 23:11:15,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 23:11:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:11:15,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:15,071 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:15,071 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-18 23:11:15,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:15,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142699145] [2019-12-18 23:11:15,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:15,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142699145] [2019-12-18 23:11:15,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:15,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:15,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033499534] [2019-12-18 23:11:15,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:15,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:15,108 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 23:11:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:15,228 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-18 23:11:15,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:15,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:11:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:15,252 INFO L225 Difference]: With dead ends: 10720 [2019-12-18 23:11:15,252 INFO L226 Difference]: Without dead ends: 10716 [2019-12-18 23:11:15,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-18 23:11:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-18 23:11:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 23:11:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 23:11:15,436 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 23:11:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:15,436 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 23:11:15,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 23:11:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:15,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:15,437 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:15,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-18 23:11:15,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:15,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604204232] [2019-12-18 23:11:15,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:15,480 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-18 23:11:15,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604204232] [2019-12-18 23:11:15,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540813278] [2019-12-18 23:11:15,480 INFO L94 rtionOrderModulation]: Keeping assertion order 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-18 23:11:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:15,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:15,561 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:15,564 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-18 23:11:15,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:15,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:15,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512825491] [2019-12-18 23:11:15,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:15,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:15,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:15,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:15,565 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 7 states. [2019-12-18 23:11:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:15,911 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-18 23:11:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:15,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:15,946 INFO L225 Difference]: With dead ends: 16250 [2019-12-18 23:11:15,946 INFO L226 Difference]: Without dead ends: 16246 [2019-12-18 23:11:15,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-18 23:11:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-18 23:11:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-18 23:11:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-18 23:11:16,147 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-18 23:11:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:16,147 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-18 23:11:16,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-18 23:11:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:16,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:16,148 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:16,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:16,349 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-18 23:11:16,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:16,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740171181] [2019-12-18 23:11:16,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:16,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740171181] [2019-12-18 23:11:16,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:16,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:16,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99447158] [2019-12-18 23:11:16,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:16,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:16,393 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-18 23:11:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:16,655 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-18 23:11:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:16,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:16,689 INFO L225 Difference]: With dead ends: 16584 [2019-12-18 23:11:16,689 INFO L226 Difference]: Without dead ends: 16579 [2019-12-18 23:11:16,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-18 23:11:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-18 23:11:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-18 23:11:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-18 23:11:17,587 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-18 23:11:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:17,587 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-18 23:11:17,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-18 23:11:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:17,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:17,588 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:17,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-18 23:11:17,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:17,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56110030] [2019-12-18 23:11:17,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:17,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56110030] [2019-12-18 23:11:17,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:17,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:17,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639678679] [2019-12-18 23:11:17,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:17,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:17,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:17,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:17,620 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-18 23:11:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:17,721 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-18 23:11:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:17,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:17,747 INFO L225 Difference]: With dead ends: 11876 [2019-12-18 23:11:17,748 INFO L226 Difference]: Without dead ends: 11868 [2019-12-18 23:11:17,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-18 23:11:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-18 23:11:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-18 23:11:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-18 23:11:17,918 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-18 23:11:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:17,918 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-18 23:11:17,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-18 23:11:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:17,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:17,919 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:17,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:17,920 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-18 23:11:17,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:17,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706000145] [2019-12-18 23:11:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:17,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706000145] [2019-12-18 23:11:17,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152474798] [2019-12-18 23:11:17,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:18,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:18,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:18,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:18,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:18,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063520170] [2019-12-18 23:11:18,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:18,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:18,044 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 7 states. [2019-12-18 23:11:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:18,311 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-18 23:11:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:18,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:18,352 INFO L225 Difference]: With dead ends: 18509 [2019-12-18 23:11:18,352 INFO L226 Difference]: Without dead ends: 18503 [2019-12-18 23:11:18,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-18 23:11:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-18 23:11:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-18 23:11:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-18 23:11:18,771 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-18 23:11:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:18,772 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-18 23:11:18,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-18 23:11:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:18,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:18,773 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:18,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:18,974 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-18 23:11:18,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:18,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444539048] [2019-12-18 23:11:18,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:19,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444539048] [2019-12-18 23:11:19,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241153213] [2019-12-18 23:11:19,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:19,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:19,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:19,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:19,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:19,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569511716] [2019-12-18 23:11:19,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:19,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:19,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:19,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:19,095 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-18 23:11:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:19,394 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-18 23:11:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:19,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:19,473 INFO L225 Difference]: With dead ends: 19158 [2019-12-18 23:11:19,473 INFO L226 Difference]: Without dead ends: 19149 [2019-12-18 23:11:19,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-18 23:11:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-18 23:11:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-18 23:11:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-18 23:11:19,855 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-18 23:11:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:19,856 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-18 23:11:19,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-18 23:11:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:19,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:19,857 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:20,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:20,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-18 23:11:20,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:20,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455998239] [2019-12-18 23:11:20,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:20,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455998239] [2019-12-18 23:11:20,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:20,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:20,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485318989] [2019-12-18 23:11:20,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:20,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:20,102 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-18 23:11:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:20,601 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-18 23:11:20,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:20,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:20,671 INFO L225 Difference]: With dead ends: 19350 [2019-12-18 23:11:20,671 INFO L226 Difference]: Without dead ends: 19341 [2019-12-18 23:11:20,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-18 23:11:20,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-18 23:11:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-18 23:11:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-18 23:11:20,961 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-18 23:11:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:20,961 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-18 23:11:20,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-18 23:11:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:20,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:20,962 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:20,963 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-18 23:11:20,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:20,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797603107] [2019-12-18 23:11:20,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:20,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797603107] [2019-12-18 23:11:20,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:20,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:20,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28620877] [2019-12-18 23:11:20,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:20,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:20,999 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-18 23:11:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:21,278 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-18 23:11:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:21,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:21,318 INFO L225 Difference]: With dead ends: 19087 [2019-12-18 23:11:21,319 INFO L226 Difference]: Without dead ends: 19078 [2019-12-18 23:11:21,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-18 23:11:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-18 23:11:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-18 23:11:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-18 23:11:21,571 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-18 23:11:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:21,571 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-18 23:11:21,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-18 23:11:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:21,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:21,572 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:21,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-18 23:11:21,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:21,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127519493] [2019-12-18 23:11:21,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:21,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127519493] [2019-12-18 23:11:21,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874003248] [2019-12-18 23:11:21,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:21,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:21,696 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:21,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:21,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:21,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020496994] [2019-12-18 23:11:21,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:21,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:21,701 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 9 states. [2019-12-18 23:11:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:22,464 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-18 23:11:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:22,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:22,520 INFO L225 Difference]: With dead ends: 26399 [2019-12-18 23:11:22,521 INFO L226 Difference]: Without dead ends: 26395 [2019-12-18 23:11:22,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-18 23:11:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 7999. [2019-12-18 23:11:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-18 23:11:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-18 23:11:22,812 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-18 23:11:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:22,812 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-18 23:11:22,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-18 23:11:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:22,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:22,813 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:23,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:23,014 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-18 23:11:23,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:23,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107084015] [2019-12-18 23:11:23,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:23,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107084015] [2019-12-18 23:11:23,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302144532] [2019-12-18 23:11:23,065 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 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-18 23:11:23,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:23,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:23,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:23,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:23,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:23,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:23,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512265349] [2019-12-18 23:11:23,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:23,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:23,146 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 9 states. [2019-12-18 23:11:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:23,752 INFO L93 Difference]: Finished difference Result 26109 states and 99244 transitions. [2019-12-18 23:11:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:23,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:23,807 INFO L225 Difference]: With dead ends: 26109 [2019-12-18 23:11:23,807 INFO L226 Difference]: Without dead ends: 26103 [2019-12-18 23:11:23,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-12-18 23:11:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 7893. [2019-12-18 23:11:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-18 23:11:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-18 23:11:24,243 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-18 23:11:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:24,243 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-18 23:11:24,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-18 23:11:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:24,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:24,244 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:24,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:24,445 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-18 23:11:24,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:24,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844624972] [2019-12-18 23:11:24,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:24,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844624972] [2019-12-18 23:11:24,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477682297] [2019-12-18 23:11:24,491 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 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-18 23:11:24,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:11:24,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:24,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:24,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:24,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:24,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:24,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904982023] [2019-12-18 23:11:24,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:24,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:24,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:24,601 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-18 23:11:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:25,237 INFO L93 Difference]: Finished difference Result 26144 states and 99382 transitions. [2019-12-18 23:11:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:25,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:25,302 INFO L225 Difference]: With dead ends: 26144 [2019-12-18 23:11:25,302 INFO L226 Difference]: Without dead ends: 26140 [2019-12-18 23:11:25,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26140 states. [2019-12-18 23:11:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26140 to 7675. [2019-12-18 23:11:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-18 23:11:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-18 23:11:25,578 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-18 23:11:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:25,578 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-18 23:11:25,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-18 23:11:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:25,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:25,579 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:25,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:25,780 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-18 23:11:25,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:25,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348716956] [2019-12-18 23:11:25,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:25,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348716956] [2019-12-18 23:11:25,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147936095] [2019-12-18 23:11:25,826 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 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-18 23:11:25,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:25,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:25,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:25,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:25,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:25,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:25,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954535096] [2019-12-18 23:11:25,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:25,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:25,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:25,927 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 9 states. [2019-12-18 23:11:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:26,624 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-18 23:11:26,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:26,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:26,679 INFO L225 Difference]: With dead ends: 25959 [2019-12-18 23:11:26,680 INFO L226 Difference]: Without dead ends: 25953 [2019-12-18 23:11:26,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-18 23:11:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-18 23:11:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-18 23:11:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-18 23:11:26,959 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-18 23:11:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:26,959 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-18 23:11:26,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-18 23:11:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:26,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:26,960 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:27,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:27,164 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-18 23:11:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:27,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97100914] [2019-12-18 23:11:27,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:27,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97100914] [2019-12-18 23:11:27,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:27,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:27,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810588688] [2019-12-18 23:11:27,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:27,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:27,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:27,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:27,197 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-18 23:11:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:27,337 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-18 23:11:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:27,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:11:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:27,376 INFO L225 Difference]: With dead ends: 12952 [2019-12-18 23:11:27,377 INFO L226 Difference]: Without dead ends: 12936 [2019-12-18 23:11:27,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-18 23:11:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-18 23:11:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-18 23:11:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-18 23:11:27,563 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-18 23:11:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:27,563 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-18 23:11:27,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-18 23:11:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:27,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:27,565 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:27,565 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-18 23:11:27,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:27,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504740647] [2019-12-18 23:11:27,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:27,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504740647] [2019-12-18 23:11:27,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:27,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:27,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522225223] [2019-12-18 23:11:27,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:27,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:27,623 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-18 23:11:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:28,404 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-18 23:11:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:28,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:28,469 INFO L225 Difference]: With dead ends: 29252 [2019-12-18 23:11:28,469 INFO L226 Difference]: Without dead ends: 29245 [2019-12-18 23:11:28,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-18 23:11:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-18 23:11:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 23:11:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-18 23:11:28,793 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-18 23:11:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:28,793 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-18 23:11:28,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-18 23:11:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:28,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:28,795 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:28,795 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-18 23:11:28,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:28,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244808770] [2019-12-18 23:11:28,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:28,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244808770] [2019-12-18 23:11:28,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:28,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:28,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852778425] [2019-12-18 23:11:28,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:28,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:28,855 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-18 23:11:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:29,650 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-18 23:11:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:29,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:29,751 INFO L225 Difference]: With dead ends: 28866 [2019-12-18 23:11:29,751 INFO L226 Difference]: Without dead ends: 28856 [2019-12-18 23:11:29,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-18 23:11:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-18 23:11:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-18 23:11:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-18 23:11:30,209 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-18 23:11:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:30,210 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-18 23:11:30,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-18 23:11:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:30,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:30,212 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:30,212 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-18 23:11:30,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:30,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18403184] [2019-12-18 23:11:30,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:30,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18403184] [2019-12-18 23:11:30,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95950424] [2019-12-18 23:11:30,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:30,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:30,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:30,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:30,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:30,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48628837] [2019-12-18 23:11:30,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:30,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:30,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:30,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:30,330 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 7 states. [2019-12-18 23:11:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:30,761 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-18 23:11:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:30,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:30,802 INFO L225 Difference]: With dead ends: 19371 [2019-12-18 23:11:30,803 INFO L226 Difference]: Without dead ends: 19359 [2019-12-18 23:11:30,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-18 23:11:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-18 23:11:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 23:11:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-18 23:11:31,023 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-18 23:11:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:31,023 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-18 23:11:31,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-18 23:11:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:31,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:31,025 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:31,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:31,226 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-18 23:11:31,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:31,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534630512] [2019-12-18 23:11:31,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:31,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534630512] [2019-12-18 23:11:31,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501105625] [2019-12-18 23:11:31,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:31,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:31,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:31,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:31,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:31,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246262057] [2019-12-18 23:11:31,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:31,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:31,356 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 7 states. [2019-12-18 23:11:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:31,652 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-18 23:11:31,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:31,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:31,699 INFO L225 Difference]: With dead ends: 20331 [2019-12-18 23:11:31,699 INFO L226 Difference]: Without dead ends: 20317 [2019-12-18 23:11:31,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-18 23:11:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-18 23:11:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-18 23:11:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-18 23:11:31,937 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-18 23:11:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:31,937 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-18 23:11:31,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-18 23:11:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:31,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:31,940 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:32,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:32,143 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:32,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:32,143 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-18 23:11:32,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:32,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549334491] [2019-12-18 23:11:32,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:32,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549334491] [2019-12-18 23:11:32,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:32,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:32,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630059591] [2019-12-18 23:11:32,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:32,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:32,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:32,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:32,178 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-18 23:11:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:32,423 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-18 23:11:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:32,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:32,469 INFO L225 Difference]: With dead ends: 20594 [2019-12-18 23:11:32,469 INFO L226 Difference]: Without dead ends: 20575 [2019-12-18 23:11:32,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-18 23:11:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-18 23:11:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-18 23:11:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-18 23:11:32,907 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-18 23:11:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:32,907 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-18 23:11:32,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-18 23:11:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:32,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:32,909 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:32,909 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-18 23:11:32,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:32,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351309223] [2019-12-18 23:11:32,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:32,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351309223] [2019-12-18 23:11:32,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:32,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:32,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946692678] [2019-12-18 23:11:32,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:32,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:32,942 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-18 23:11:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:33,195 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-18 23:11:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:33,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:33,236 INFO L225 Difference]: With dead ends: 20360 [2019-12-18 23:11:33,236 INFO L226 Difference]: Without dead ends: 20341 [2019-12-18 23:11:33,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-18 23:11:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-18 23:11:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 23:11:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-18 23:11:33,476 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-18 23:11:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:33,477 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-18 23:11:33,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-18 23:11:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:33,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:33,479 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:33,479 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-18 23:11:33,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:33,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457590008] [2019-12-18 23:11:33,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:33,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457590008] [2019-12-18 23:11:33,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:33,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:33,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327114164] [2019-12-18 23:11:33,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:33,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:33,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:33,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:33,513 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-18 23:11:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:33,784 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-18 23:11:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:33,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:33,828 INFO L225 Difference]: With dead ends: 20740 [2019-12-18 23:11:33,828 INFO L226 Difference]: Without dead ends: 20721 [2019-12-18 23:11:33,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-18 23:11:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-18 23:11:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-18 23:11:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-18 23:11:34,071 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-18 23:11:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:34,072 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-18 23:11:34,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-18 23:11:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:34,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:34,074 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:34,074 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-18 23:11:34,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:34,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842391877] [2019-12-18 23:11:34,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:34,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842391877] [2019-12-18 23:11:34,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:34,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:34,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145539378] [2019-12-18 23:11:34,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:34,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:34,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:34,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:34,108 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 7 states. [2019-12-18 23:11:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:34,384 INFO L93 Difference]: Finished difference Result 20896 states and 85782 transitions. [2019-12-18 23:11:34,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:34,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:34,430 INFO L225 Difference]: With dead ends: 20896 [2019-12-18 23:11:34,430 INFO L226 Difference]: Without dead ends: 20877 [2019-12-18 23:11:34,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-18 23:11:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 9286. [2019-12-18 23:11:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-18 23:11:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-18 23:11:34,704 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-18 23:11:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:34,704 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-18 23:11:34,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-18 23:11:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:34,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:34,707 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:34,708 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-18 23:11:34,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:34,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099956569] [2019-12-18 23:11:34,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:34,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099956569] [2019-12-18 23:11:34,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354187458] [2019-12-18 23:11:34,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:34,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:34,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:34,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:34,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:34,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701384561] [2019-12-18 23:11:34,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:34,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:34,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:34,860 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 9 states. [2019-12-18 23:11:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:35,548 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-18 23:11:35,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:35,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:35,610 INFO L225 Difference]: With dead ends: 29793 [2019-12-18 23:11:35,610 INFO L226 Difference]: Without dead ends: 29783 [2019-12-18 23:11:35,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-18 23:11:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9200. [2019-12-18 23:11:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-18 23:11:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-18 23:11:35,938 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-18 23:11:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:35,938 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-18 23:11:35,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-18 23:11:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:35,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:35,941 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:36,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:36,142 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-18 23:11:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:36,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164589635] [2019-12-18 23:11:36,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164589635] [2019-12-18 23:11:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662246100] [2019-12-18 23:11:36,192 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 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-18 23:11:36,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:36,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:36,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:36,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:36,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:36,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:36,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444827182] [2019-12-18 23:11:36,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:36,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:36,296 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 9 states. [2019-12-18 23:11:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:36,912 INFO L93 Difference]: Finished difference Result 29319 states and 113201 transitions. [2019-12-18 23:11:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:36,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:36,973 INFO L225 Difference]: With dead ends: 29319 [2019-12-18 23:11:36,973 INFO L226 Difference]: Without dead ends: 29308 [2019-12-18 23:11:36,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29308 states. [2019-12-18 23:11:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29308 to 9197. [2019-12-18 23:11:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-18 23:11:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-18 23:11:37,282 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-18 23:11:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:37,282 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-18 23:11:37,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-18 23:11:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:37,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:37,285 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:37,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:37,486 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-18 23:11:37,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:37,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369161983] [2019-12-18 23:11:37,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:37,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369161983] [2019-12-18 23:11:37,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862382659] [2019-12-18 23:11:37,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:37,618 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:37,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:37,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:37,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:37,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506967515] [2019-12-18 23:11:37,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:37,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:37,630 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 9 states. [2019-12-18 23:11:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:38,293 INFO L93 Difference]: Finished difference Result 28997 states and 111934 transitions. [2019-12-18 23:11:38,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:38,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:38,352 INFO L225 Difference]: With dead ends: 28997 [2019-12-18 23:11:38,353 INFO L226 Difference]: Without dead ends: 28987 [2019-12-18 23:11:38,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28987 states. [2019-12-18 23:11:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28987 to 9121. [2019-12-18 23:11:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-18 23:11:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-18 23:11:38,682 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-18 23:11:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:38,683 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-18 23:11:38,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-18 23:11:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:38,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:38,686 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:38,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:38,887 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-18 23:11:38,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:38,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524858365] [2019-12-18 23:11:38,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:38,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524858365] [2019-12-18 23:11:38,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241038822] [2019-12-18 23:11:38,938 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 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-18 23:11:39,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:39,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:39,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:39,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:39,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:39,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:39,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039995984] [2019-12-18 23:11:39,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:39,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:39,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:39,021 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 9 states. [2019-12-18 23:11:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:39,629 INFO L93 Difference]: Finished difference Result 28781 states and 111002 transitions. [2019-12-18 23:11:39,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:39,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:39,688 INFO L225 Difference]: With dead ends: 28781 [2019-12-18 23:11:39,688 INFO L226 Difference]: Without dead ends: 28770 [2019-12-18 23:11:39,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-18 23:11:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 9044. [2019-12-18 23:11:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-18 23:11:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-18 23:11:39,988 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-18 23:11:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:39,988 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-18 23:11:39,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-18 23:11:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:39,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:39,991 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:40,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:40,192 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-18 23:11:40,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:40,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543320056] [2019-12-18 23:11:40,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 23:11:40,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543320056] [2019-12-18 23:11:40,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781961041] [2019-12-18 23:11:40,239 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 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-18 23:11:40,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 23:11:40,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:40,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:40,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 23:11:40,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:40,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:40,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619010190] [2019-12-18 23:11:40,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:40,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:40,320 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 9 states. [2019-12-18 23:11:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:40,900 INFO L93 Difference]: Finished difference Result 28747 states and 110799 transitions. [2019-12-18 23:11:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:40,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:40,962 INFO L225 Difference]: With dead ends: 28747 [2019-12-18 23:11:40,963 INFO L226 Difference]: Without dead ends: 28737 [2019-12-18 23:11:40,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-18 23:11:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 8874. [2019-12-18 23:11:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-18 23:11:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-18 23:11:41,397 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-18 23:11:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:41,397 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-18 23:11:41,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-18 23:11:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:41,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:41,400 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:41,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:41,601 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-18 23:11:41,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:41,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303479766] [2019-12-18 23:11:41,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:41,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303479766] [2019-12-18 23:11:41,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074805928] [2019-12-18 23:11:41,655 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 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-18 23:11:41,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:41,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:41,728 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:41,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:41,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:41,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:41,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158002791] [2019-12-18 23:11:41,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:41,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:41,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:41,734 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 9 states. [2019-12-18 23:11:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:42,388 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-18 23:11:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:42,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:42,448 INFO L225 Difference]: With dead ends: 28993 [2019-12-18 23:11:42,448 INFO L226 Difference]: Without dead ends: 28982 [2019-12-18 23:11:42,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-18 23:11:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-18 23:11:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-18 23:11:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-18 23:11:42,747 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-18 23:11:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:42,747 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-18 23:11:42,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-18 23:11:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:42,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:42,750 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:42,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:42,952 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-18 23:11:42,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:42,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229573947] [2019-12-18 23:11:42,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:43,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229573947] [2019-12-18 23:11:43,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112941821] [2019-12-18 23:11:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:11:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:43,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:43,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:43,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:43,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:43,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840328590] [2019-12-18 23:11:43,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:43,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:43,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:43,083 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 9 states. [2019-12-18 23:11:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:43,730 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-18 23:11:43,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:43,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:43,789 INFO L225 Difference]: With dead ends: 28840 [2019-12-18 23:11:43,789 INFO L226 Difference]: Without dead ends: 28830 [2019-12-18 23:11:43,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-18 23:11:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-18 23:11:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-18 23:11:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-18 23:11:44,086 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-18 23:11:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:44,086 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-18 23:11:44,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-18 23:11:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:44,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:44,089 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:44,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:44,290 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-18 23:11:44,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:44,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489822877] [2019-12-18 23:11:44,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:44,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489822877] [2019-12-18 23:11:44,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384581289] [2019-12-18 23:11:44,352 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 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-18 23:11:44,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:44,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:44,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:44,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:44,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:44,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248802980] [2019-12-18 23:11:44,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:44,457 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 9 states. [2019-12-18 23:11:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:45,281 INFO L93 Difference]: Finished difference Result 28552 states and 110204 transitions. [2019-12-18 23:11:45,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:45,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:45,336 INFO L225 Difference]: With dead ends: 28552 [2019-12-18 23:11:45,337 INFO L226 Difference]: Without dead ends: 28538 [2019-12-18 23:11:45,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-18 23:11:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8722. [2019-12-18 23:11:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-18 23:11:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-18 23:11:45,635 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-18 23:11:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:45,636 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-18 23:11:45,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-18 23:11:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:45,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:45,639 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:45,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:45,840 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-18 23:11:45,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:45,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806843308] [2019-12-18 23:11:45,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:45,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806843308] [2019-12-18 23:11:45,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:45,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:45,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954718761] [2019-12-18 23:11:45,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:45,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:45,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:45,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:45,894 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-18 23:11:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:46,502 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-18 23:11:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:46,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:46,560 INFO L225 Difference]: With dead ends: 28362 [2019-12-18 23:11:46,560 INFO L226 Difference]: Without dead ends: 28352 [2019-12-18 23:11:46,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-18 23:11:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-18 23:11:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-18 23:11:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-18 23:11:46,851 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-18 23:11:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:46,851 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-18 23:11:46,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-18 23:11:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:46,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:46,854 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:46,854 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-18 23:11:46,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:46,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643291710] [2019-12-18 23:11:46,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:46,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643291710] [2019-12-18 23:11:46,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:46,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:46,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657529163] [2019-12-18 23:11:46,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:46,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:46,906 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-18 23:11:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:47,539 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-18 23:11:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:47,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:47,597 INFO L225 Difference]: With dead ends: 28156 [2019-12-18 23:11:47,597 INFO L226 Difference]: Without dead ends: 28146 [2019-12-18 23:11:47,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-18 23:11:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-18 23:11:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-18 23:11:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-18 23:11:47,879 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-18 23:11:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:47,880 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-18 23:11:47,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-18 23:11:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:47,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:47,883 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:47,883 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-18 23:11:47,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:47,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601917728] [2019-12-18 23:11:47,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:47,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601917728] [2019-12-18 23:11:47,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:47,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:47,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559695415] [2019-12-18 23:11:47,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:47,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:47,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:47,933 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-18 23:11:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:48,630 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-18 23:11:48,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:48,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:48,687 INFO L225 Difference]: With dead ends: 27714 [2019-12-18 23:11:48,688 INFO L226 Difference]: Without dead ends: 27700 [2019-12-18 23:11:48,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-18 23:11:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-18 23:11:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-18 23:11:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-18 23:11:48,967 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-18 23:11:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:48,968 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-18 23:11:48,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-18 23:11:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:48,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:48,971 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:48,971 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:48,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-18 23:11:48,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:48,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058028722] [2019-12-18 23:11:48,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:49,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058028722] [2019-12-18 23:11:49,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:49,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:49,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880033646] [2019-12-18 23:11:49,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:49,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:49,019 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-18 23:11:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:49,655 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-18 23:11:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:49,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:49,711 INFO L225 Difference]: With dead ends: 27553 [2019-12-18 23:11:49,711 INFO L226 Difference]: Without dead ends: 27543 [2019-12-18 23:11:49,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-18 23:11:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-18 23:11:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-18 23:11:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-18 23:11:49,984 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-18 23:11:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:49,984 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-18 23:11:49,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-18 23:11:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:49,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:49,987 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:49,987 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-18 23:11:49,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:49,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970983237] [2019-12-18 23:11:49,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:50,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970983237] [2019-12-18 23:11:50,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:50,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:50,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640438711] [2019-12-18 23:11:50,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:50,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:50,042 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-18 23:11:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:50,649 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-18 23:11:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:50,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:50,710 INFO L225 Difference]: With dead ends: 27570 [2019-12-18 23:11:50,711 INFO L226 Difference]: Without dead ends: 27556 [2019-12-18 23:11:50,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-18 23:11:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-18 23:11:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-18 23:11:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-18 23:11:50,994 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-18 23:11:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:50,994 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-18 23:11:50,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-18 23:11:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:50,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:50,997 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:50,998 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-18 23:11:50,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:50,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6996257] [2019-12-18 23:11:50,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:51,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6996257] [2019-12-18 23:11:51,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:51,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:51,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521381764] [2019-12-18 23:11:51,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:51,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:51,049 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-18 23:11:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:51,655 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-18 23:11:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:51,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:51,857 INFO L225 Difference]: With dead ends: 27265 [2019-12-18 23:11:51,857 INFO L226 Difference]: Without dead ends: 27251 [2019-12-18 23:11:51,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-18 23:11:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-18 23:11:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-18 23:11:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-18 23:11:52,100 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-18 23:11:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:52,101 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-18 23:11:52,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-18 23:11:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:52,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:52,103 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:52,104 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-18 23:11:52,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:52,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720944532] [2019-12-18 23:11:52,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 23:11:52,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720944532] [2019-12-18 23:11:52,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:52,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:52,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748744294] [2019-12-18 23:11:52,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:52,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:52,143 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-18 23:11:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:52,264 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-18 23:11:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:52,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 23:11:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:52,292 INFO L225 Difference]: With dead ends: 12944 [2019-12-18 23:11:52,292 INFO L226 Difference]: Without dead ends: 12912 [2019-12-18 23:11:52,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-18 23:11:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-18 23:11:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-18 23:11:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-18 23:11:52,470 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-18 23:11:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:52,470 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-18 23:11:52,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-18 23:11:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:52,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:52,473 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:52,473 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:52,474 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-18 23:11:52,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:52,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8108672] [2019-12-18 23:11:52,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:52,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8108672] [2019-12-18 23:11:52,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:52,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:52,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225628684] [2019-12-18 23:11:52,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:52,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:52,521 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 9 states. [2019-12-18 23:11:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:53,148 INFO L93 Difference]: Finished difference Result 30802 states and 119509 transitions. [2019-12-18 23:11:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:53,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:53,213 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 23:11:53,213 INFO L226 Difference]: Without dead ends: 30786 [2019-12-18 23:11:53,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30786 states. [2019-12-18 23:11:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30786 to 9188. [2019-12-18 23:11:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-18 23:11:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-18 23:11:53,531 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-18 23:11:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:53,531 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-18 23:11:53,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-18 23:11:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:53,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:53,534 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:53,534 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:53,535 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-18 23:11:53,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:53,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970680062] [2019-12-18 23:11:53,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:53,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970680062] [2019-12-18 23:11:53,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:53,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:53,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839926564] [2019-12-18 23:11:53,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:53,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:53,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:53,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:53,574 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 9 states. [2019-12-18 23:11:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:54,168 INFO L93 Difference]: Finished difference Result 30412 states and 117823 transitions. [2019-12-18 23:11:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:54,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:54,231 INFO L225 Difference]: With dead ends: 30412 [2019-12-18 23:11:54,231 INFO L226 Difference]: Without dead ends: 30392 [2019-12-18 23:11:54,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-18 23:11:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 8937. [2019-12-18 23:11:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-18 23:11:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-18 23:11:54,544 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-18 23:11:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:54,544 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-18 23:11:54,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-18 23:11:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:54,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:54,547 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:54,547 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:54,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:54,547 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-18 23:11:54,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:54,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322465217] [2019-12-18 23:11:54,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:54,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322465217] [2019-12-18 23:11:54,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:54,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:54,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823048379] [2019-12-18 23:11:54,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:54,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:54,607 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 9 states. [2019-12-18 23:11:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:55,308 INFO L93 Difference]: Finished difference Result 30029 states and 116246 transitions. [2019-12-18 23:11:55,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:55,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:55,505 INFO L225 Difference]: With dead ends: 30029 [2019-12-18 23:11:55,505 INFO L226 Difference]: Without dead ends: 30013 [2019-12-18 23:11:55,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-18 23:11:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 8839. [2019-12-18 23:11:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-18 23:11:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-18 23:11:55,789 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-18 23:11:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:55,789 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-18 23:11:55,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-18 23:11:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:55,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:55,792 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:55,792 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-18 23:11:55,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:55,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419252755] [2019-12-18 23:11:55,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419252755] [2019-12-18 23:11:55,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:55,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:55,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980668915] [2019-12-18 23:11:55,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:55,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:55,842 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 9 states. [2019-12-18 23:11:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:56,503 INFO L93 Difference]: Finished difference Result 29761 states and 115069 transitions. [2019-12-18 23:11:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:56,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:56,564 INFO L225 Difference]: With dead ends: 29761 [2019-12-18 23:11:56,565 INFO L226 Difference]: Without dead ends: 29741 [2019-12-18 23:11:56,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29741 states. [2019-12-18 23:11:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29741 to 8516. [2019-12-18 23:11:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-18 23:11:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-18 23:11:56,862 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-18 23:11:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:56,862 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-18 23:11:56,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-18 23:11:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 23:11:56,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:56,866 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:56,866 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-18 23:11:56,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:56,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744726273] [2019-12-18 23:11:56,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:56,883 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:11:56,884 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:11:56,884 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:11:56,884 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-18 23:11:56,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,916 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,916 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,917 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,917 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,917 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,919 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,930 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,930 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,930 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,930 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,930 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,931 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,932 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,932 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,932 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,932 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,933 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,933 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,934 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,935 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,938 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,939 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,948 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,948 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,948 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,949 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,949 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,949 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:56,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-18 23:11:56,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:11:56,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:11:56,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:11:56,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:11:56,950 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:11:56,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:11:56,951 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:11:56,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:11:56,952 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-18 23:11:56,952 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 23:11:56,971 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 23:11:56,972 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:56,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 108/263 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-18 23:11:56,983 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 23:11:57,001 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 23:11:57,001 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:57,004 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 108/263 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-18 23:11:57,013 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-18 23:11:57,014 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:58,912 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:11:59,036 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-18 23:11:59,036 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 23:11:59,037 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-18 23:12:00,243 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-18 23:12:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-18 23:12:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:12:00,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:00,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:12:00,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:00,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-18 23:12:00,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:00,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878678042] [2019-12-18 23:12:00,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:00,250 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-18 23:12:00,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878678042] [2019-12-18 23:12:00,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:00,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:12:00,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201606665] [2019-12-18 23:12:00,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:12:00,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:12:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:12:00,252 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-18 23:12:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:00,523 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-18 23:12:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:12:00,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:12:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:00,569 INFO L225 Difference]: With dead ends: 17885 [2019-12-18 23:12:00,569 INFO L226 Difference]: Without dead ends: 16791 [2019-12-18 23:12:00,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:12:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-18 23:12:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-18 23:12:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-18 23:12:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-18 23:12:00,922 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-18 23:12:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:00,923 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-18 23:12:00,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:12:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-18 23:12:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:12:00,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:00,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:00,923 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:00,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-18 23:12:00,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:00,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143588274] [2019-12-18 23:12:00,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:00,969 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-18 23:12:00,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143588274] [2019-12-18 23:12:00,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:00,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:00,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55390754] [2019-12-18 23:12:00,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:00,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:00,971 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-18 23:12:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:01,175 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-18 23:12:01,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:01,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:12:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:01,255 INFO L225 Difference]: With dead ends: 29874 [2019-12-18 23:12:01,256 INFO L226 Difference]: Without dead ends: 29871 [2019-12-18 23:12:01,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-18 23:12:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-18 23:12:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 23:12:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-18 23:12:01,776 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-18 23:12:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:01,776 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-18 23:12:01,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-18 23:12:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:12:01,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:01,776 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:01,777 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-18 23:12:01,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:01,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163847398] [2019-12-18 23:12:01,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:12:01,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163847398] [2019-12-18 23:12:01,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:01,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:01,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448036960] [2019-12-18 23:12:01,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:01,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:01,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:01,793 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-18 23:12:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:02,027 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-18 23:12:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:02,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:12:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:02,123 INFO L225 Difference]: With dead ends: 34948 [2019-12-18 23:12:02,123 INFO L226 Difference]: Without dead ends: 34944 [2019-12-18 23:12:02,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-18 23:12:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-18 23:12:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-18 23:12:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-18 23:12:05,121 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-18 23:12:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:05,122 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-18 23:12:05,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-18 23:12:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:12:05,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:05,122 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:05,122 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:05,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-18 23:12:05,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:05,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391463078] [2019-12-18 23:12:05,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:05,166 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-18 23:12:05,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391463078] [2019-12-18 23:12:05,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483236707] [2019-12-18 23:12:05,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:12:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:05,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:05,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:05,261 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-18 23:12:05,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:05,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:05,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405439466] [2019-12-18 23:12:05,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:05,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:05,262 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-18 23:12:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:05,722 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-18 23:12:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:05,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:12:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:05,876 INFO L225 Difference]: With dead ends: 54752 [2019-12-18 23:12:05,876 INFO L226 Difference]: Without dead ends: 54748 [2019-12-18 23:12:05,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-18 23:12:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-18 23:12:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-18 23:12:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-18 23:12:06,680 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-18 23:12:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:06,681 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-18 23:12:06,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-18 23:12:06,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:12:06,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:06,681 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:06,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:06,882 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-18 23:12:06,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:06,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652208194] [2019-12-18 23:12:06,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:12:06,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652208194] [2019-12-18 23:12:06,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:06,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:06,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523622512] [2019-12-18 23:12:06,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:06,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:06,910 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-18 23:12:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:07,353 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-18 23:12:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:07,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:12:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:07,513 INFO L225 Difference]: With dead ends: 56062 [2019-12-18 23:12:07,513 INFO L226 Difference]: Without dead ends: 56057 [2019-12-18 23:12:07,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-18 23:12:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-18 23:12:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-18 23:12:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-18 23:12:08,808 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-18 23:12:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:08,808 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-18 23:12:08,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-18 23:12:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:12:08,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:08,809 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:08,809 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:08,809 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-18 23:12:08,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:08,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866444545] [2019-12-18 23:12:08,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:08,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866444545] [2019-12-18 23:12:08,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:08,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:08,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956388760] [2019-12-18 23:12:08,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:08,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:08,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:08,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:08,827 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-18 23:12:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:09,101 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-18 23:12:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:09,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:12:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:09,215 INFO L225 Difference]: With dead ends: 40360 [2019-12-18 23:12:09,215 INFO L226 Difference]: Without dead ends: 40352 [2019-12-18 23:12:09,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-18 23:12:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-18 23:12:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-18 23:12:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-18 23:12:09,953 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-18 23:12:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:09,953 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-18 23:12:09,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-18 23:12:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:09,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:09,954 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:09,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-18 23:12:09,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:09,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457183522] [2019-12-18 23:12:09,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:09,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457183522] [2019-12-18 23:12:09,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861351621] [2019-12-18 23:12:09,984 INFO L94 rtionOrderModulation]: Keeping assertion order 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-18 23:12:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:10,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:10,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:10,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:10,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:10,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826181034] [2019-12-18 23:12:10,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:10,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:10,076 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-18 23:12:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:10,580 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-18 23:12:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:10,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:10,763 INFO L225 Difference]: With dead ends: 64531 [2019-12-18 23:12:10,763 INFO L226 Difference]: Without dead ends: 64525 [2019-12-18 23:12:10,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-18 23:12:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-18 23:12:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 23:12:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-18 23:12:14,124 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-18 23:12:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:14,124 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-18 23:12:14,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-18 23:12:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:14,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:14,126 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:14,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:14,329 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-18 23:12:14,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:14,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155938957] [2019-12-18 23:12:14,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:14,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155938957] [2019-12-18 23:12:14,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:14,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:14,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461921473] [2019-12-18 23:12:14,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:14,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:14,366 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-18 23:12:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:14,891 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-18 23:12:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:14,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:15,077 INFO L225 Difference]: With dead ends: 66182 [2019-12-18 23:12:15,077 INFO L226 Difference]: Without dead ends: 66173 [2019-12-18 23:12:15,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-18 23:12:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-18 23:12:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-18 23:12:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-18 23:12:16,065 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-18 23:12:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:16,065 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-18 23:12:16,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-18 23:12:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:16,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:16,066 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:16,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-18 23:12:16,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:16,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120072761] [2019-12-18 23:12:16,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:16,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120072761] [2019-12-18 23:12:16,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:16,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:16,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127758496] [2019-12-18 23:12:16,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:16,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:16,106 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-18 23:12:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:16,621 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-18 23:12:16,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:16,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:16,811 INFO L225 Difference]: With dead ends: 66741 [2019-12-18 23:12:16,811 INFO L226 Difference]: Without dead ends: 66732 [2019-12-18 23:12:16,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-18 23:12:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-18 23:12:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-18 23:12:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-18 23:12:18,493 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-18 23:12:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:18,493 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-18 23:12:18,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-18 23:12:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:18,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:18,494 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:18,494 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-18 23:12:18,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:18,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437905325] [2019-12-18 23:12:18,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:18,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437905325] [2019-12-18 23:12:18,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:18,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:18,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853262859] [2019-12-18 23:12:18,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:18,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:18,529 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 7 states. [2019-12-18 23:12:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:19,038 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-18 23:12:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:19,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:19,231 INFO L225 Difference]: With dead ends: 67749 [2019-12-18 23:12:19,231 INFO L226 Difference]: Without dead ends: 67740 [2019-12-18 23:12:19,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-18 23:12:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-18 23:12:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-18 23:12:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-18 23:12:20,228 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-18 23:12:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:20,228 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-18 23:12:20,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-18 23:12:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:20,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:20,229 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:20,229 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-18 23:12:20,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:20,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346524903] [2019-12-18 23:12:20,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:20,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346524903] [2019-12-18 23:12:20,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858157633] [2019-12-18 23:12:20,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:12:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:20,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:12:20,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:20,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:20,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:12:20,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896437031] [2019-12-18 23:12:20,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:20,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:20,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:20,375 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 9 states. [2019-12-18 23:12:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:22,435 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-18 23:12:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:22,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:22,700 INFO L225 Difference]: With dead ends: 97639 [2019-12-18 23:12:22,701 INFO L226 Difference]: Without dead ends: 97635 [2019-12-18 23:12:22,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-18 23:12:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27701. [2019-12-18 23:12:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-18 23:12:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-18 23:12:24,031 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-18 23:12:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:24,032 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-18 23:12:24,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-18 23:12:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:24,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:24,033 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:24,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:24,236 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-18 23:12:24,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:24,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930141149] [2019-12-18 23:12:24,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:24,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930141149] [2019-12-18 23:12:24,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880872933] [2019-12-18 23:12:24,274 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 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-18 23:12:24,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:12:24,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:24,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:12:24,357 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:24,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:24,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:12:24,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285646944] [2019-12-18 23:12:24,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:24,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:24,361 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 9 states. [2019-12-18 23:12:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:26,118 INFO L93 Difference]: Finished difference Result 96845 states and 436549 transitions. [2019-12-18 23:12:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:26,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:26,385 INFO L225 Difference]: With dead ends: 96845 [2019-12-18 23:12:26,385 INFO L226 Difference]: Without dead ends: 96839 [2019-12-18 23:12:26,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96839 states. [2019-12-18 23:12:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96839 to 27343. [2019-12-18 23:12:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-18 23:12:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-18 23:12:27,688 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-18 23:12:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:27,688 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-18 23:12:27,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-18 23:12:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:27,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:27,689 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:27,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:27,890 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-18 23:12:27,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:27,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370386934] [2019-12-18 23:12:27,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:12:27,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370386934] [2019-12-18 23:12:27,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:27,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:27,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187741370] [2019-12-18 23:12:27,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:27,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:27,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:27,911 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-18 23:12:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:28,224 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-18 23:12:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:28,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:12:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:28,365 INFO L225 Difference]: With dead ends: 49005 [2019-12-18 23:12:28,365 INFO L226 Difference]: Without dead ends: 48989 [2019-12-18 23:12:28,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-18 23:12:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-18 23:12:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-18 23:12:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-18 23:12:31,251 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-18 23:12:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:31,251 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-18 23:12:31,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-18 23:12:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:31,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:31,252 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:31,253 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-18 23:12:31,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:31,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465651469] [2019-12-18 23:12:31,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:31,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465651469] [2019-12-18 23:12:31,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:31,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:31,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465996009] [2019-12-18 23:12:31,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:31,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:31,329 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-18 23:12:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:32,389 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-18 23:12:32,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:32,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:32,704 INFO L225 Difference]: With dead ends: 112418 [2019-12-18 23:12:32,704 INFO L226 Difference]: Without dead ends: 112411 [2019-12-18 23:12:32,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-18 23:12:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-18 23:12:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-18 23:12:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-18 23:12:34,968 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-18 23:12:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:34,968 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-18 23:12:34,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-18 23:12:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:34,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:34,969 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:34,969 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-18 23:12:34,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:34,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206678415] [2019-12-18 23:12:34,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:35,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206678415] [2019-12-18 23:12:35,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:35,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:35,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280022838] [2019-12-18 23:12:35,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:35,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:35,015 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-18 23:12:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:36,104 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-18 23:12:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:36,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:36,417 INFO L225 Difference]: With dead ends: 111816 [2019-12-18 23:12:36,417 INFO L226 Difference]: Without dead ends: 111807 [2019-12-18 23:12:36,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-18 23:12:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-18 23:12:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-18 23:12:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-18 23:12:40,922 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-18 23:12:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:40,922 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-18 23:12:40,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-18 23:12:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:40,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:40,923 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:40,923 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-18 23:12:40,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:40,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684729294] [2019-12-18 23:12:40,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:40,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684729294] [2019-12-18 23:12:40,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:40,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:40,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753079414] [2019-12-18 23:12:40,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:40,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:40,970 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 9 states. [2019-12-18 23:12:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:42,016 INFO L93 Difference]: Finished difference Result 112148 states and 515023 transitions. [2019-12-18 23:12:42,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:42,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:42,332 INFO L225 Difference]: With dead ends: 112148 [2019-12-18 23:12:42,332 INFO L226 Difference]: Without dead ends: 112141 [2019-12-18 23:12:42,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112141 states. [2019-12-18 23:12:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112141 to 31950. [2019-12-18 23:12:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-18 23:12:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-18 23:12:44,529 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-18 23:12:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:44,530 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-18 23:12:44,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-18 23:12:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:44,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:44,531 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:44,531 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-18 23:12:44,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:44,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955667926] [2019-12-18 23:12:44,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:44,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955667926] [2019-12-18 23:12:44,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:44,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:44,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335664382] [2019-12-18 23:12:44,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:44,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:44,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:44,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:44,576 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 9 states. [2019-12-18 23:12:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:45,596 INFO L93 Difference]: Finished difference Result 111038 states and 509212 transitions. [2019-12-18 23:12:45,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:45,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:48,654 INFO L225 Difference]: With dead ends: 111038 [2019-12-18 23:12:48,654 INFO L226 Difference]: Without dead ends: 111028 [2019-12-18 23:12:48,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111028 states. [2019-12-18 23:12:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111028 to 30899. [2019-12-18 23:12:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-18 23:12:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-18 23:12:50,068 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-18 23:12:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:50,069 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-18 23:12:50,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-18 23:12:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:50,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:50,070 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:50,071 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-18 23:12:50,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:50,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81832378] [2019-12-18 23:12:50,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:50,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81832378] [2019-12-18 23:12:50,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592791043] [2019-12-18 23:12:50,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:12:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:50,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:50,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:50,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:50,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:50,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258010885] [2019-12-18 23:12:50,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:50,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:50,191 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-18 23:12:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:51,332 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-18 23:12:51,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:51,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:51,543 INFO L225 Difference]: With dead ends: 73073 [2019-12-18 23:12:51,543 INFO L226 Difference]: Without dead ends: 73061 [2019-12-18 23:12:51,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-18 23:12:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-18 23:12:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-18 23:12:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-18 23:12:52,618 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-18 23:12:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:52,619 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-18 23:12:52,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-18 23:12:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:52,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:52,620 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:52,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:52,821 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:52,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-18 23:12:52,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:52,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021506701] [2019-12-18 23:12:52,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:52,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021506701] [2019-12-18 23:12:52,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703831471] [2019-12-18 23:12:52,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:12:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:52,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:52,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:52,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:52,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:52,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79381844] [2019-12-18 23:12:52,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:52,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:52,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:52,947 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-18 23:12:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:53,516 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-18 23:12:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:53,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:54,377 INFO L225 Difference]: With dead ends: 77025 [2019-12-18 23:12:54,377 INFO L226 Difference]: Without dead ends: 77011 [2019-12-18 23:12:54,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-18 23:12:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-18 23:12:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-18 23:12:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-18 23:12:55,448 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-18 23:12:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-18 23:12:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-18 23:12:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:55,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:55,450 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:55,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:55,651 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-18 23:12:55,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:55,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006565412] [2019-12-18 23:12:55,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:12:55,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006565412] [2019-12-18 23:12:55,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:55,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:55,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035034645] [2019-12-18 23:12:55,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:55,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:55,681 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-18 23:12:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:56,288 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-18 23:12:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:56,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:56,517 INFO L225 Difference]: With dead ends: 78384 [2019-12-18 23:12:56,517 INFO L226 Difference]: Without dead ends: 78365 [2019-12-18 23:12:56,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-18 23:12:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-18 23:12:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-18 23:12:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-18 23:12:58,182 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-18 23:12:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:58,182 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-18 23:12:58,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-18 23:12:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:58,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:58,184 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:58,184 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-18 23:12:58,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:58,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623682056] [2019-12-18 23:12:58,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:12:58,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623682056] [2019-12-18 23:12:58,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:58,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:58,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379741206] [2019-12-18 23:12:58,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:58,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:58,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:58,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:58,215 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-18 23:12:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:58,774 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-18 23:12:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:58,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:59,002 INFO L225 Difference]: With dead ends: 78506 [2019-12-18 23:12:59,002 INFO L226 Difference]: Without dead ends: 78487 [2019-12-18 23:12:59,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-18 23:13:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-18 23:13:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-18 23:13:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-18 23:13:00,699 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-18 23:13:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:00,699 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-18 23:13:00,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-18 23:13:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:13:00,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:00,701 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:00,701 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-18 23:13:00,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:00,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803461390] [2019-12-18 23:13:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:00,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803461390] [2019-12-18 23:13:00,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:00,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:13:00,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199474811] [2019-12-18 23:13:00,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:13:00,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:13:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:00,730 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-18 23:13:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:01,314 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-18 23:13:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:13:01,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:13:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:01,554 INFO L225 Difference]: With dead ends: 80886 [2019-12-18 23:13:01,555 INFO L226 Difference]: Without dead ends: 80867 [2019-12-18 23:13:01,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:13:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-18 23:13:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-18 23:13:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-18 23:13:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-18 23:13:03,343 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-18 23:13:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:03,344 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-18 23:13:03,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-18 23:13:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:13:03,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:03,346 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:03,346 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-18 23:13:03,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:03,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535300709] [2019-12-18 23:13:03,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:03,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535300709] [2019-12-18 23:13:03,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:03,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:13:03,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615525887] [2019-12-18 23:13:03,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:13:03,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:13:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:03,377 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 7 states. [2019-12-18 23:13:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:03,967 INFO L93 Difference]: Finished difference Result 81926 states and 399875 transitions. [2019-12-18 23:13:03,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:13:03,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:13:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:04,213 INFO L225 Difference]: With dead ends: 81926 [2019-12-18 23:13:04,213 INFO L226 Difference]: Without dead ends: 81907 [2019-12-18 23:13:04,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:13:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81907 states. [2019-12-18 23:13:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81907 to 35912. [2019-12-18 23:13:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-18 23:13:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-18 23:13:06,294 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-18 23:13:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:06,295 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-18 23:13:06,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-18 23:13:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:06,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:06,298 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:06,298 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-18 23:13:06,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:06,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005955725] [2019-12-18 23:13:06,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:06,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005955725] [2019-12-18 23:13:06,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267813407] [2019-12-18 23:13:06,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:13:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:06,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:06,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:06,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:06,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:06,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154005675] [2019-12-18 23:13:06,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:06,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:06,434 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 9 states. [2019-12-18 23:13:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:07,505 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-18 23:13:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:07,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:07,845 INFO L225 Difference]: With dead ends: 119601 [2019-12-18 23:13:07,845 INFO L226 Difference]: Without dead ends: 119591 [2019-12-18 23:13:07,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-18 23:13:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35598. [2019-12-18 23:13:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-18 23:13:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-18 23:13:12,586 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-18 23:13:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:12,586 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-18 23:13:12,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-18 23:13:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:12,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:12,589 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:12,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:12,790 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-18 23:13:12,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:12,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23191363] [2019-12-18 23:13:12,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:12,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23191363] [2019-12-18 23:13:12,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895727998] [2019-12-18 23:13:12,839 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 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-18 23:13:12,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:12,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:12,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:12,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:12,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:12,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:12,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062442511] [2019-12-18 23:13:12,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:12,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:12,969 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 9 states. [2019-12-18 23:13:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:14,165 INFO L93 Difference]: Finished difference Result 118295 states and 546185 transitions. [2019-12-18 23:13:14,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:14,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:14,503 INFO L225 Difference]: With dead ends: 118295 [2019-12-18 23:13:14,503 INFO L226 Difference]: Without dead ends: 118284 [2019-12-18 23:13:14,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118284 states. [2019-12-18 23:13:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118284 to 35531. [2019-12-18 23:13:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 23:13:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-18 23:13:16,787 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-18 23:13:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:16,787 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-18 23:13:16,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-18 23:13:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:16,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:16,791 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:16,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:16,992 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:16,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-18 23:13:16,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:16,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028610465] [2019-12-18 23:13:16,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:17,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028610465] [2019-12-18 23:13:17,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372243442] [2019-12-18 23:13:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:13:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:17,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:17,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:17,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:17,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:17,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709138138] [2019-12-18 23:13:17,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:17,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:17,124 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 9 states. [2019-12-18 23:13:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:18,173 INFO L93 Difference]: Finished difference Result 117353 states and 541624 transitions. [2019-12-18 23:13:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:18,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:19,404 INFO L225 Difference]: With dead ends: 117353 [2019-12-18 23:13:19,404 INFO L226 Difference]: Without dead ends: 117343 [2019-12-18 23:13:19,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117343 states. [2019-12-18 23:13:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117343 to 35223. [2019-12-18 23:13:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-18 23:13:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-18 23:13:20,877 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-18 23:13:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:20,877 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-18 23:13:20,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-18 23:13:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:20,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:20,879 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:21,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:21,080 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-18 23:13:21,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:21,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420343896] [2019-12-18 23:13:21,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:21,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420343896] [2019-12-18 23:13:21,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098527560] [2019-12-18 23:13:21,121 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 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-18 23:13:21,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:21,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:21,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:21,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:21,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:21,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:21,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777856532] [2019-12-18 23:13:21,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:21,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:21,212 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 9 states. [2019-12-18 23:13:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:22,714 INFO L93 Difference]: Finished difference Result 116621 states and 537886 transitions. [2019-12-18 23:13:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:22,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:23,053 INFO L225 Difference]: With dead ends: 116621 [2019-12-18 23:13:23,053 INFO L226 Difference]: Without dead ends: 116610 [2019-12-18 23:13:23,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116610 states. [2019-12-18 23:13:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116610 to 34934. [2019-12-18 23:13:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-18 23:13:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-18 23:13:24,626 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-18 23:13:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:24,626 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-18 23:13:24,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-18 23:13:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:24,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:24,630 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:24,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:24,831 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:24,831 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-18 23:13:24,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:24,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872133892] [2019-12-18 23:13:24,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:24,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872133892] [2019-12-18 23:13:24,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824367669] [2019-12-18 23:13:24,870 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 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-18 23:13:26,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:13:26,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:26,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:26,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:27,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:27,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:27,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107856617] [2019-12-18 23:13:27,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:27,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:27,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:27,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:27,004 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 9 states. [2019-12-18 23:13:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:28,140 INFO L93 Difference]: Finished difference Result 116675 states and 538001 transitions. [2019-12-18 23:13:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:28,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:28,465 INFO L225 Difference]: With dead ends: 116675 [2019-12-18 23:13:28,465 INFO L226 Difference]: Without dead ends: 116665 [2019-12-18 23:13:28,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116665 states. [2019-12-18 23:13:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116665 to 34396. [2019-12-18 23:13:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-18 23:13:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-18 23:13:30,483 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-18 23:13:30,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:30,483 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-18 23:13:30,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-18 23:13:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:30,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:30,486 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:30,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:30,687 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-18 23:13:30,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:30,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388056067] [2019-12-18 23:13:30,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:30,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388056067] [2019-12-18 23:13:30,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704810752] [2019-12-18 23:13:30,731 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 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-18 23:13:30,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:13:30,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:30,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:30,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:30,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:30,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:30,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960996902] [2019-12-18 23:13:30,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:30,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:30,822 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-18 23:13:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:31,897 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-18 23:13:31,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:31,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:32,226 INFO L225 Difference]: With dead ends: 117673 [2019-12-18 23:13:32,226 INFO L226 Difference]: Without dead ends: 117662 [2019-12-18 23:13:32,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-18 23:13:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-18 23:13:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-18 23:13:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-18 23:13:34,472 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-18 23:13:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:34,472 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-18 23:13:34,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-18 23:13:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:34,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:34,474 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:34,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:34,675 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-18 23:13:34,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:34,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531725392] [2019-12-18 23:13:34,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:34,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531725392] [2019-12-18 23:13:34,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110602255] [2019-12-18 23:13:34,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-18 23:13:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:34,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:34,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:34,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:34,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:34,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082058566] [2019-12-18 23:13:34,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:34,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:34,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:34,869 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-18 23:13:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:35,954 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-18 23:13:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:35,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:36,297 INFO L225 Difference]: With dead ends: 117232 [2019-12-18 23:13:36,297 INFO L226 Difference]: Without dead ends: 117222 [2019-12-18 23:13:36,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-18 23:13:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-18 23:13:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-18 23:13:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-18 23:13:38,367 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-18 23:13:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:38,367 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-18 23:13:38,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-18 23:13:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:38,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:38,370 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:38,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:38,573 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-18 23:13:38,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:38,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806657638] [2019-12-18 23:13:38,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:38,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806657638] [2019-12-18 23:13:38,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567800429] [2019-12-18 23:13:38,614 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 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-18 23:13:38,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:38,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:38,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:38,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:38,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:38,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:38,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682586799] [2019-12-18 23:13:38,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:38,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:38,706 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 9 states. [2019-12-18 23:13:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:40,345 INFO L93 Difference]: Finished difference Result 116256 states and 536656 transitions. [2019-12-18 23:13:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:40,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:40,686 INFO L225 Difference]: With dead ends: 116256 [2019-12-18 23:13:40,686 INFO L226 Difference]: Without dead ends: 116242 [2019-12-18 23:13:40,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116242 states. [2019-12-18 23:13:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116242 to 33768. [2019-12-18 23:13:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-18 23:13:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-18 23:13:42,188 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-18 23:13:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:42,189 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-18 23:13:42,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-18 23:13:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:42,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:42,191 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:42,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:42,394 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-18 23:13:42,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:42,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805026007] [2019-12-18 23:13:42,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 23:13:42,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805026007] [2019-12-18 23:13:42,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:42,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:13:42,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527447849] [2019-12-18 23:13:42,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:13:42,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:13:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:13:42,417 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-18 23:13:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:42,777 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-18 23:13:42,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:13:42,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 23:13:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:43,422 INFO L225 Difference]: With dead ends: 59584 [2019-12-18 23:13:43,422 INFO L226 Difference]: Without dead ends: 59552 [2019-12-18 23:13:43,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-18 23:13:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-18 23:13:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-18 23:13:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-18 23:13:44,470 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-18 23:13:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:44,470 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-18 23:13:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:13:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-18 23:13:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:44,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:44,473 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:44,473 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-18 23:13:44,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:44,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974898807] [2019-12-18 23:13:44,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:44,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974898807] [2019-12-18 23:13:44,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:44,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:13:44,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572535767] [2019-12-18 23:13:44,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:44,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:44,524 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-18 23:13:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:45,665 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-18 23:13:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:45,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:46,809 INFO L225 Difference]: With dead ends: 137478 [2019-12-18 23:13:46,809 INFO L226 Difference]: Without dead ends: 137462 [2019-12-18 23:13:46,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-18 23:13:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-18 23:13:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-18 23:13:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-18 23:13:48,643 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-18 23:13:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:48,643 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-18 23:13:48,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-18 23:13:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:48,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:48,646 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:48,646 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-18 23:13:48,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:48,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554781432] [2019-12-18 23:13:48,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:48,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554781432] [2019-12-18 23:13:48,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:48,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:13:48,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896068709] [2019-12-18 23:13:48,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:48,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:48,692 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-18 23:13:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:50,155 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-18 23:13:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:50,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:50,551 INFO L225 Difference]: With dead ends: 136774 [2019-12-18 23:13:50,551 INFO L226 Difference]: Without dead ends: 136758 [2019-12-18 23:13:50,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-18 23:13:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-18 23:13:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-18 23:13:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-18 23:13:53,144 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-18 23:13:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:53,145 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-18 23:13:53,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-18 23:13:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:53,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:53,147 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:53,147 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-18 23:13:53,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:53,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528331209] [2019-12-18 23:13:53,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:53,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528331209] [2019-12-18 23:13:53,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:53,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:13:53,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114829872] [2019-12-18 23:13:53,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:53,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:53,198 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-18 23:13:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:54,369 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-18 23:13:54,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:54,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:54,749 INFO L225 Difference]: With dead ends: 134734 [2019-12-18 23:13:54,749 INFO L226 Difference]: Without dead ends: 134714 [2019-12-18 23:13:54,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-18 23:14:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-18 23:14:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-18 23:14:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-18 23:14:00,247 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-18 23:14:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:00,248 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-18 23:14:00,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-18 23:14:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:00,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:00,250 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:00,250 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:00,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-18 23:14:00,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:00,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551089948] [2019-12-18 23:14:00,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:00,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551089948] [2019-12-18 23:14:00,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:00,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:00,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755273608] [2019-12-18 23:14:00,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:00,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:00,292 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-18 23:14:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:01,517 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-18 23:14:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:01,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:02,691 INFO L225 Difference]: With dead ends: 134487 [2019-12-18 23:14:02,692 INFO L226 Difference]: Without dead ends: 134471 [2019-12-18 23:14:02,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-18 23:14:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134471 to 39586. [2019-12-18 23:14:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 23:14:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 214214 transitions. [2019-12-18 23:14:04,449 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 214214 transitions. Word has length 25 [2019-12-18 23:14:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:04,449 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 214214 transitions. [2019-12-18 23:14:04,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 214214 transitions. [2019-12-18 23:14:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:04,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:04,452 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:04,452 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash -69926921, now seen corresponding path program 4 times [2019-12-18 23:14:04,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:04,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722010728] [2019-12-18 23:14:04,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:04,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722010728] [2019-12-18 23:14:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:04,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178098481] [2019-12-18 23:14:04,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:04,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:04,501 INFO L87 Difference]: Start difference. First operand 39586 states and 214214 transitions. Second operand 9 states. [2019-12-18 23:14:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:06,242 INFO L93 Difference]: Finished difference Result 134693 states and 630836 transitions. [2019-12-18 23:14:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:06,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:06,633 INFO L225 Difference]: With dead ends: 134693 [2019-12-18 23:14:06,633 INFO L226 Difference]: Without dead ends: 134673 [2019-12-18 23:14:06,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2019-12-18 23:14:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 39511. [2019-12-18 23:14:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39511 states. [2019-12-18 23:14:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39511 states to 39511 states and 213636 transitions. [2019-12-18 23:14:11,718 INFO L78 Accepts]: Start accepts. Automaton has 39511 states and 213636 transitions. Word has length 25 [2019-12-18 23:14:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:11,718 INFO L462 AbstractCegarLoop]: Abstraction has 39511 states and 213636 transitions. [2019-12-18 23:14:11,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 39511 states and 213636 transitions. [2019-12-18 23:14:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:11,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:11,720 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:11,720 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash -69941956, now seen corresponding path program 4 times [2019-12-18 23:14:11,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:11,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632347262] [2019-12-18 23:14:11,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:11,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632347262] [2019-12-18 23:14:11,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:11,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:11,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686130358] [2019-12-18 23:14:11,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:11,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:11,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:11,775 INFO L87 Difference]: Start difference. First operand 39511 states and 213636 transitions. Second operand 9 states. [2019-12-18 23:14:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:12,890 INFO L93 Difference]: Finished difference Result 133500 states and 624860 transitions. [2019-12-18 23:14:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:12,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:13,275 INFO L225 Difference]: With dead ends: 133500 [2019-12-18 23:14:13,275 INFO L226 Difference]: Without dead ends: 133480 [2019-12-18 23:14:13,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133480 states. [2019-12-18 23:14:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133480 to 39284. [2019-12-18 23:14:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39284 states. [2019-12-18 23:14:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39284 states to 39284 states and 212213 transitions. [2019-12-18 23:14:15,831 INFO L78 Accepts]: Start accepts. Automaton has 39284 states and 212213 transitions. Word has length 25 [2019-12-18 23:14:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:15,831 INFO L462 AbstractCegarLoop]: Abstraction has 39284 states and 212213 transitions. [2019-12-18 23:14:15,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 39284 states and 212213 transitions. [2019-12-18 23:14:15,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:15,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:15,833 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:15,833 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:15,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1098510199, now seen corresponding path program 5 times [2019-12-18 23:14:15,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:15,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928200567] [2019-12-18 23:14:15,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:15,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928200567] [2019-12-18 23:14:15,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:15,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:15,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42554265] [2019-12-18 23:14:15,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:15,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:15,906 INFO L87 Difference]: Start difference. First operand 39284 states and 212213 transitions. Second operand 9 states. [2019-12-18 23:14:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:17,905 INFO L93 Difference]: Finished difference Result 134278 states and 628555 transitions. [2019-12-18 23:14:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:17,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:18,293 INFO L225 Difference]: With dead ends: 134278 [2019-12-18 23:14:18,293 INFO L226 Difference]: Without dead ends: 134262 [2019-12-18 23:14:18,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134262 states. [2019-12-18 23:14:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134262 to 38762. [2019-12-18 23:14:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2019-12-18 23:14:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 209279 transitions. [2019-12-18 23:14:20,052 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 209279 transitions. Word has length 25 [2019-12-18 23:14:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:20,052 INFO L462 AbstractCegarLoop]: Abstraction has 38762 states and 209279 transitions. [2019-12-18 23:14:20,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 209279 transitions. [2019-12-18 23:14:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:20,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:20,054 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:20,054 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1084061564, now seen corresponding path program 5 times [2019-12-18 23:14:20,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:20,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416051060] [2019-12-18 23:14:20,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:20,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416051060] [2019-12-18 23:14:20,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:20,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:20,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609365757] [2019-12-18 23:14:20,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:20,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:20,102 INFO L87 Difference]: Start difference. First operand 38762 states and 209279 transitions. Second operand 9 states. [2019-12-18 23:14:20,444 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 23:14:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:21,544 INFO L93 Difference]: Finished difference Result 133154 states and 622565 transitions. [2019-12-18 23:14:21,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:21,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:21,939 INFO L225 Difference]: With dead ends: 133154 [2019-12-18 23:14:21,939 INFO L226 Difference]: Without dead ends: 133138 [2019-12-18 23:14:21,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133138 states. [2019-12-18 23:14:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133138 to 38386. [2019-12-18 23:14:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38386 states. [2019-12-18 23:14:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38386 states to 38386 states and 207260 transitions. [2019-12-18 23:14:26,882 INFO L78 Accepts]: Start accepts. Automaton has 38386 states and 207260 transitions. Word has length 25 [2019-12-18 23:14:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:26,882 INFO L462 AbstractCegarLoop]: Abstraction has 38386 states and 207260 transitions. [2019-12-18 23:14:26,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38386 states and 207260 transitions. [2019-12-18 23:14:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:26,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:26,885 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:26,885 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:26,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1074047479, now seen corresponding path program 6 times [2019-12-18 23:14:26,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:26,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578074494] [2019-12-18 23:14:26,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:26,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578074494] [2019-12-18 23:14:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:26,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427688820] [2019-12-18 23:14:26,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:26,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:26,934 INFO L87 Difference]: Start difference. First operand 38386 states and 207260 transitions. Second operand 9 states. [2019-12-18 23:14:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:28,089 INFO L93 Difference]: Finished difference Result 132300 states and 618178 transitions. [2019-12-18 23:14:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:28,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:28,470 INFO L225 Difference]: With dead ends: 132300 [2019-12-18 23:14:28,471 INFO L226 Difference]: Without dead ends: 132280 [2019-12-18 23:14:28,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132280 states. [2019-12-18 23:14:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132280 to 37647. [2019-12-18 23:14:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37647 states. [2019-12-18 23:14:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37647 states to 37647 states and 203286 transitions. [2019-12-18 23:14:30,957 INFO L78 Accepts]: Start accepts. Automaton has 37647 states and 203286 transitions. Word has length 25 [2019-12-18 23:14:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:30,957 INFO L462 AbstractCegarLoop]: Abstraction has 37647 states and 203286 transitions. [2019-12-18 23:14:30,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 37647 states and 203286 transitions. [2019-12-18 23:14:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:30,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:30,959 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:30,959 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1074032444, now seen corresponding path program 6 times [2019-12-18 23:14:30,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:30,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759635186] [2019-12-18 23:14:30,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:31,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759635186] [2019-12-18 23:14:31,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:31,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:31,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198060994] [2019-12-18 23:14:31,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:31,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:31,019 INFO L87 Difference]: Start difference. First operand 37647 states and 203286 transitions. Second operand 9 states. [2019-12-18 23:14:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:32,925 INFO L93 Difference]: Finished difference Result 131107 states and 612202 transitions. [2019-12-18 23:14:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:32,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:33,314 INFO L225 Difference]: With dead ends: 131107 [2019-12-18 23:14:33,314 INFO L226 Difference]: Without dead ends: 131087 [2019-12-18 23:14:33,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131087 states. [2019-12-18 23:14:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131087 to 36710. [2019-12-18 23:14:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36710 states. [2019-12-18 23:14:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36710 states to 36710 states and 198310 transitions. [2019-12-18 23:14:34,992 INFO L78 Accepts]: Start accepts. Automaton has 36710 states and 198310 transitions. Word has length 25 [2019-12-18 23:14:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:34,993 INFO L462 AbstractCegarLoop]: Abstraction has 36710 states and 198310 transitions. [2019-12-18 23:14:34,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 36710 states and 198310 transitions. [2019-12-18 23:14:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 23:14:34,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:34,996 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:34,996 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:34,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 729716532, now seen corresponding path program 1 times [2019-12-18 23:14:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:34,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966394491] [2019-12-18 23:14:34,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-18 23:14:35,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966394491] [2019-12-18 23:14:35,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914654131] [2019-12-18 23:14:35,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 Received shutdown request... [2019-12-18 23:14:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:37,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:14:37,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:37,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:37,425 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:14:37,429 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:14:37,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:14:37 BasicIcfg [2019-12-18 23:14:37,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:14:37,430 INFO L168 Benchmark]: Toolchain (without parser) took 225939.75 ms. Allocated memory was 143.1 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 99.9 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 477.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:37,430 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 143.1 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 23:14:37,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.25 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 99.5 MB in the beginning and 160.2 MB in the end (delta: -60.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:37,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.04 ms. Allocated memory is still 201.3 MB. Free memory was 160.2 MB in the beginning and 158.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:37,431 INFO L168 Benchmark]: Boogie Preprocessor took 33.99 ms. Allocated memory is still 201.3 MB. Free memory was 158.2 MB in the beginning and 156.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:37,432 INFO L168 Benchmark]: RCFGBuilder took 389.57 ms. Allocated memory is still 201.3 MB. Free memory was 156.1 MB in the beginning and 137.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:37,432 INFO L168 Benchmark]: TraceAbstraction took 224683.89 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 137.3 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 457.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:37,434 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.46 ms. Allocated memory is still 143.1 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.25 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 99.5 MB in the beginning and 160.2 MB in the end (delta: -60.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.04 ms. Allocated memory is still 201.3 MB. Free memory was 160.2 MB in the beginning and 158.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.99 ms. Allocated memory is still 201.3 MB. Free memory was 158.2 MB in the beginning and 156.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.57 ms. Allocated memory is still 201.3 MB. Free memory was 156.1 MB in the beginning and 137.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224683.89 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 137.3 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 457.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 160.4s, OverallIterations: 43, TraceHistogramMax: 5, AutomataDifference: 58.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3343 SDtfs, 10332 SDslu, 10230 SDs, 0 SdLazy, 11569 SolverSat, 822 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1210 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 902 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5750 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 88.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 2625345 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1174 ConstructedInterpolants, 0 QuantifiedInterpolants, 77100 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 588/782 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 could not prove your program: Timeout Completed graceful shutdown